uplink commit mapping and resource allocation

专利摘要:
Disclosure aspects refer to a programmed entity that obtains a resource allocation for transmission of a confirmation payload (ACK) / negative confirmation (NACK) using implicit resource mapping based on at least one of a scrambling identifier or one of a plurality of control resource sets (CORESETs) and transmits the ACK / NACK payload based on the resource allocation obtained. In one respect, a programmed entity obtains an allocation of resources to transmit different types of uplink control information (UCI), in which the allocation of resources is based on a combination of the different types of UCI and transmits the different types of UCI with based on the allocation of resources obtained. Other aspects, modalities and characteristics are also claimed and described.
公开号:BR112020004668A2
申请号:R112020004668-0
申请日:2018-09-11
公开日:2020-09-15
发明作者:Sony Akkarakaran；Renqiu Wang；Yi Huang；Tao Luo；Juan Montojo；Seyong Park；Peter Gaal
申请人:Qualcomm Incorporated；
IPC主号:

专利说明:

[0001] [0001] This Patent Application claims priority for Non-Provisional Patent Application No. 16 / 126,993 filed with the United States Patent and Trademark Office on September 10, 2018, and Provisional Patent Application No. 62 / 557,103 filed with the United States Patent and Trademark Office on September 11, 2017, the entire contents of which are incorporated herein by way of reference as if completely presented below in their entirety and for all applicable purposes. TECHNICAL FIELD
[0002] [0002] The technology discussed below generally refers to wireless communication systems and, more specifically, the facilitation of uplink transmissions. Certain modalities can provide and enable techniques for uplink confirmation mapping and resource allocation on next generation wireless networks (such as, for example, 5G) with minimal overhead and low levels of interference. INTRODUCTION
[0003] [0003] In wireless networks, a programmed entity (such as user equipment (UE)) can transmit uplink control information (UCI) to a programming entity (such as, for example, base station, gateway network access, eNodeB). The UCI can include confirmation messages (ACK) / negative confirmation (NACK). Generally, before sending UCIs, a programmed entity may need to obtain resources (such as resource block allocation, ACK / NACK payload mapping) allocated to transmit UCIs.
[0004] [0004] As demand for mobile broadband access continues to increase, research and development continues to advance in wireless communication technologies, not only to meet the growing demand for mobile broadband access, but to advance and the improvement of user experiences with mobile communications. BRIEF SUMMARY OF SOME EXAMPLES
[0005] [0005] The following is a simplified summary of one or more aspects, in order to obtain a basic understanding of such aspects. This summary is not an extensive overview of all aspects covered and is not intended to identify key or essential elements of all aspects or to outline the scope of any or all aspects. Its sole purpose is to present some concepts of one or more aspects in a simplified form as an introduction to the more detailed description that is presented later.
[0006] [0006] According to some aspects of the disclosure, a method is provided for a programmed entity to communicate with a programming entity on a wireless communication network. The programmed entity can obtain an allocation of resources to transmit a confirmation payload (ACK) / negative confirmation (NACK) (sometimes referred to as the ACK / NACK payload). The programmed entity can obtain resources using implicit resource mapping. This mapping can be based on at least one of a scrambling identifier or one of a plurality of control resource sets (CORESETs). The programming entity can transmit the ACK / NACK payload based on the resource allocation obtained.
[0007] [0007] According to some aspects of the disclosure, a method is provided for a programmed entity to communicate with a programming entity on a wireless communication network. The programmed entity can obtain an allocation of resources to transmit different types of uplink control (UCI) information. Resource allocation is based on a combination of the different types of UCI. The programming entity can transmit the different types of UCIs based on the allocation of resources obtained.
[0008] [0008] According to some aspects of the disclosure, a method is provided for a programmed entity to communicate with a programming entity on a wireless communication network. The programmed entity can obtain a plurality of downlink control information (DCI) formats from the programmed entity. Each of the plurality of DCI formats includes a different amount of information for dynamic programming. The programmed entity can obtain an indicator that identifies one among the plurality of DCI formats. The programmed entity can receive downlink control information based on the identified unit among the plurality of DCI formats.
[0009] [0009] According to some aspects of the disclosure, a method is provided for a programmed entity to communicate with a programming entity on a wireless communication network. The programmed entity can obtain an allocation of resources for the transmission of a confirmation payload (ACK) / negative confirmation (NACK). The programmed entity can obtain resource allocation using an implicit mapping. This mapping identifies an uplink control channel resource based on at least one of an initial resource block index, a first displacement index, or an orthogonal coverage code (OCC) in the time domain. The programmed entity can transmit the ACK / NACK payload based on the resource allocation obtained.
[0010] [0010] According to some aspects of the disclosure, a method is provided for a programmed entity to communicate with a programming entity on a wireless communication network. The programmed entity can generate one or more channel state information (CSI) reports for a number of component carriers. The number of component carriers can be less than or equal to a limit. The scheduled entity transmits one or more CSI reports to the scheduled entity.
[0011] [0011] According to some aspects of the disclosure, a method is provided for a programmed entity to communicate with a programming entity on a wireless communication network. The programmed entity can obtain control information from the programming entity on a control channel. The programmed entity can transmit an acknowledgment (ACK) for control information to the programming entity.
[0012] [0012] According to some aspects of the disclosure, a method is provided for a programmed entity to communicate with a programming entity on a wireless communication network. The programmed entity can obtain an allocation of resources for the transmission of an ACK / negative acknowledgment (NACK) payload. The programmed entity can obtain the allocation of resources by mapping to one of a plurality of sequences for a transmission based on the sequence of the ACK / NACK payload. The mapping can vary over time based on one or more parameters. The programmed entity can transmit the ACK / NACK payload based on the resource allocation obtained.
[0013] [0013] These and other aspects of the invention will be more fully understood after reading the detailed description that follows. Other aspects, resources and modalities of the present invention will become evident to those skilled in the art, after re-reading the description of specific exemplary modalities of the present invention together with the attached figures below. Although the features of the present invention can be discussed in relation to given embodiments and figures below, all embodiments of the present invention can include one or more of the advantageous features discussed herein. In other words, although one or more modalities can be discussed as having certain advantageous features, one or more of such features can also be used in accordance with the various modalities of the invention discussed here. Likewise, although exemplary modalities can be discussed below as device, system or method modalities, it should be understood that such exemplary modalities can be implemented in different devices, systems and methods. BRIEF DESCRIPTION OF THE DRAWINGS
[0014] [0014] Figure 1 is a schematic illustration of a wireless communication system according to some modalities.
[0015] [0015] Figure 2 is a conceptual illustration of an example of a radio access network according to some modalities.
[0016] [0016] Figure 3 is a block diagram showing a wireless communication system that supports multiple-input multiple-output (MIMO) communication according to some modalities.
[0017] [0017] Figure 4 is a schematic illustration of an organization of wireless resources on an aerial interface that uses orthogonal frequency division multiplexing (OFDM) according to some modalities.
[0018] [0018] Figure 5 is a schematic illustration of exemplary standalone partitions according to some aspects of the disclosure.
[0019] [0019] Figure 6 is a block diagram that shows conceptually an example of a hardware implementation for a programming entity according to some aspects of the disclosure.
[0020] [0020] Figure 7 is a block diagram that shows conceptually an example of a hardware implementation for an entity programmed according to some aspects of the disclosure.
[0021] [0021] Figure 8 (which includes Figures 8A and 8B) shows an example of mapping an initial resource block index (RB) from a PDCCH-CCE index according to some modalities.
[0022] [0022] Figure 9 (which includes Figures 9A and 9B) shows the first and second example scenarios for a long PUCCH-ACK with partitions aggregated according to some modalities.
[0023] [0023] Figure 10 shows an example of an approach for a programmed entity to determine ACK resource information for a short PUCCH-ACK channel of a specific symbol with two bits of ACK and DCI A0 format according to some modalities.
[0024] [0024] Figure 11 shows a subframe that includes a predefined PDCCH region and an uplink region that includes a long burst region and a short burst region according to some modalities.
[0025] [0025] Figure 12 is a flow chart showing an exemplary process for a programmed entity to communicate with a programming entity on a wireless communication network according to some aspects of the disclosure.
[0026] [0026] Figure 13 is a flowchart showing an exemplary process for a programmed entity to communicate with a programming entity on a wireless communication network according to some aspects of the disclosure.
[0027] [0027] Figure 14 is a flow chart showing an exemplary process for a programmed entity to communicate with a programming entity on a wireless communication network according to some aspects of the disclosure.
[0028] [0028] Figure 15 is a flow chart showing an exemplary process for a programmed entity to communicate with a programming entity on a wireless communication network according to some aspects of the disclosure.
[0029] [0029] Figure 16 is a flowchart showing an exemplary process for a programmed entity to communicate with a programming entity on a wireless communication network according to some aspects of the disclosure.
[0030] [0030] Figure 17 is a flow chart showing an exemplary process for a programmed entity to communicate with a programming entity on a wireless communication network according to some aspects of the disclosure.
[0031] [0031] Figure 18 is a flowchart showing an exemplary process for a programmed entity to communicate with a programming entity on a wireless communication network according to some aspects of the disclosure. DETAILED DESCRIPTION
[0032] [0032] The description presented below in connection with the attached drawings is intended to be a description of several configurations and is not intended to represent the only configurations in which the concepts described here can be put into practice. The following description includes specific details in order to provide a complete understanding of several concepts. However, it will be evident to those skilled in the art that these concepts can be put into practice without these specific details.
[0033] [0033] Although aspects and modalities are described in this application by mere illustration for some examples, those skilled in the art will understand that additional implementations and case studies can occur in many different arrangements and scenarios. The innovations described here can be implemented through many different types of platforms, devices, systems, configurations, sizes, packaging layout. For example, modalities and / or uses can be obtained through integrated chip modalities and other devices not based on module components (such as, for example, end-user devices, vehicles, communication devices, computing devices, equipment industry, buy / sell devices, medical devices, AI-enabled devices, etc.). Although some examples may or may not be specifically directed to use cases or applications or applications, a wide range of applicability of the described innovations can happen. Implementations can vary in a spectrum from the level of chip or from modular components to non-modular, implementations at the level of non-chip and additionally for aggregates, distributed or OEM devices or in systems incorporation or one or more aspects of innovations described. In some practical configurations, devices incorporate aspects and features described,
[0034] [0034] The various concepts presented throughout this disclosure can be implemented through a wide variety of telecommunication systems, network architectures and communication standards. With reference now to Figure 1, as an illustrative example without limitation, several aspects of the present disclosure are shown with reference to a wireless communication system 100. Wireless communication system 100 includes three domains of interaction: a basic network 102 , a radio access network (RAN) 104 and user equipment (UE) 106. By virtue of the wireless communication system 100, the UE 106 can be enabled to perform data communication with an external data network 110, such as (but not limited to) the Internet.
[0035] [0035] RAN 104 can implement any appropriate wireless communication technology or technologies to provide radio access to UE 106. As an example,
[0036] [0036] As shown, RAN 104 includes a plurality of base stations 108. In general terms, a base station is a network element in a radio-access network responsible for transmitting and receiving radio in one or more cells to or from an UE. In different technologies, patterns or contexts, a base station can be referred to in a varied way by those skilled in the art as a transceiver base station (BTS), a radio base station, a radio transceiver, a transceiver function, a basic set of services (BSS), an extended service set (ESS), an access point (AP), a NodeB (NB), an eNodeB (eNB), a gNóB (gNB) or some other suitable terminology.
[0037] [0037] The radio access network 104 is shown additionally supporting wireless communication for multiple mobile devices. A mobile device can be referred to as user equipment (UE) in 3GPP standards. In some cases, a mobile device can also be referred to as a mobile station (MS), a subscriber station, a mobile unit, a subscriber unit, a wireless unit, a remote unit, a mobile device, a wireless device , a wireless communication device, a remote device, a mobile subscriber station, an access terminal (AT), a mobile terminal, a wireless terminal, a remote terminal, an appliance, a terminal, a user agent, a mobile client, a client or some other suitable terminology. A UE can be a device that provides the user with access to network services.
[0038] [0038] Within the present document, a "mobile" device does not necessarily need to be able to move and can be stationary. The term mobile device or mobile device refers widely to a diverse set of devices and technologies. UEs can include a number of structural hardware components sized, modeled and arranged to aid communication; such components may include antennas, antenna sets, RF chains, amplifiers, one or more processors, etc., electrically coupled to each other. For example, some non-limiting examples of a mobile device include a mobile phone, a cell phone (cell), a smart phone, a Login Protocol (SIP) phone, a laptop, a personal computer (PC), a notebook , a netbook, a smartbook, a tablet, a personal digital assistant (PDA) and a wide range of corporate systems, such as, for example, corresponding to an “Internet of Things” (IoT). A mobile device can additionally be an automobile or other transport vehicle, a remote sensor or actuator, a robot or robotic devices, a satellite radio, a global positioning system (GPS) device, an object tracking device, a drone, multicopter, quadcopter, remote control device, consumer goods and / or wearable device, such as glasses, a wearable camera, a virtual reality device, a smart watch, a health or fitness tracker , a digital audio player (such as MP3), a camera, a game console, etc.
[0039] [0039] Wireless communication between a RAN 104 and a UE 106 can be described as using an overhead interface. Air interface transmissions from a base station (such as base station 108) to one or more UEs (such as UE 106) can be referred to as downlink (DL) transmission. According to certain aspects of the present disclosure, the term downlink can refer to the transmission from one point to multiple points, which originates from a programming entity (described further below; for example, base station 108). Another way to describe this scheme may be to use the term broadcast channel multiplexing. Transmissions from a UE (such as UE 106) to a base station (such as, for example, base station 108) can be referred to as uplink (UL) transmissions. According to other aspects of the present disclosure, the term uplink can refer to transmission from point to point, which originates from a programmed entity (described further below; for example, UE 106).
[0040] [0040] In some examples, access to the air interface can be programmed. A programming entity (such as a 108 base station) can allocate resources for communication among some or all of the devices and equipment within its cell or service area. In some scenarios, as discussed further below, a programming entity may be responsible for programming, assigning, reconfiguring and releasing resources for one or more programmed entities. That is, for programmed communication, UEs 106, which can be programmed entities, can use resources allocated by the programming entity 108.
[0041] [0041] Base stations 108 are not the only entities that can function as programming entities. That is, in some examples, a UE can function as a programming entity, by programming resources for one or more programmed entities (such as, for example, one or more other UEs).
[0042] [0042] As shown in Figure 1, a programming entity 108 can broadcast downlink traffic 112 to one or more programmed entities 106. In general terms, programming entity 108 is a node or device responsible for programming traffic in a wireless communication network, which includes downlink traffic 112 and, in some instances, uplink traffic from one or more programmed entities 106 to programming entity 108. On the other hand, programmed entity 106 is a node or device that receives downlink control information 114, which includes, but is not limited to, scheduling information (such as a lease), synchronization or timing information, or other control information from another entity on the wireless communication network, such as programming entity 108.
[0043] [0043] In general, base stations 108 may include a return transport interface for communication with a return transport part 120 of the wireless communication system. The return transport 120 can provide a link between a base station 108 and the base network 102. In addition, in some instances, a return transport network can provide interconnection between the respective base stations 108. Various types of return transport interfaces they can be used, such as a direct physical connection, a virtual network or the like, using any suitable transport network.
[0044] [0044] Basic network 102 can be part of wireless communication system 100 and can be independent of the radio access technology used in RAN 104. In some examples, basic network 102 can be configured according to 5G standards ( as, for example, a 5G Central Network). In other examples, the basic network 102 can be configured according to an evolved 4G packet core (EPC), or any other suitable standard or configuration.
[0045] [0045] Referring now to Figure 2, by way of example and without limitation, a schematic illustration of a RAN 200 is provided. In some examples, the RAN 200 may be the same as the RAN 104 described above and shown in Figure 1 The geographical area covered by the RAN 200 can be divided into cellular regions (cells) that can be uniquely identified by user equipment (UE) based on an identification transmitted from an access point or base station. Figure 2 shows macro-cells 202, 204 and 206 and a small cell 208, each of which may include one or more sectors (not shown). A sector is a subarea of a cell. All sectors within a cell are served by the same base station. A radio link within a sector can be identified by a unique logical identification pertaining to that sector. In a cell that is divided into sectors, the multiple sectors within a cell can be formed by groups of antennas, with each antenna responsible for communicating with the UEs in a part of the cell.
[0046] [0046] Figure 2 also shows several base stations (BSs) as part of RAN 200. Two base stations 210 and 212 are shown in cells 202 and 204; and a third base station 214 is shown controlling a remote radio head (RRH) 216 in cell 206. A base station can have an integrated antenna or can be connected to an antenna or RRH by feeder cables. In the example shown, cells 202, 204 and 126 can be referred to as macrocells, as base stations 210, 212 and 214, support cells that are large in size. In addition, a base station 218 is shown in small cell 208 (such as a micro-cell, peak-cell, femto-cell, native base station, native NodeB, native eNodeB, etc.) that can overlap with one or more macro-cells. In this example, cell 208 can be referred to as a small cell, as base station 218 supports a cell that is relatively small in size. Cell sizing can be done according to the system design, as well as component restrictions.
[0047] [0047] The RAN 200 can include any number of base stations, nodes and wireless cells. As an example, a relay node can be deployed to extend the size or area of coverage of a given cell. Base stations 210, 212, 214, 218 provide wireless access points to a basic network for any number of mobile devices. In some examples, base stations 210, 212, 214 and / or 218 may be the same as base station / programming entity 108, described above and shown in Figure 1.
[0048] [0048] Figure 2 additionally includes a quadcopter or drone 220, which can be configured to function as a base station. That is, in some instances, a cell may not necessarily be stationary and the cell's geographic area may move according to the location of a mobile base station, such as quadcopter 220. Although not shown, drone 220 can also be other types of vehicles, which include, but are not limited to, high-altitude vessels, air vehicles, land vehicles or water vehicles.
[0049] [0049] Within the RAN 200, cells can include UEs that can be in communication with one or more sectors of each cell. In addition, each base station 210, 212, 214, 218 and 220 can be configured to provide an access point to a basic network 102 (see Figure 1) for all UEs in the respective cells. For example, UEs 222 and 224 may be in communication with base station 210; UEs 226 and 228 may be in communication with base station 212; UE 230 and 232 may be in communication with base station 214 via RRH 216; UE 234 may be in communication with base station 218; and UE 236 may be in communication with mobile base station 220. In some instances, UEs 222, 224, 226, 228, 230, 232, 234, 236, 238, 240 and / or 242 may be the same as the UE / programmed entity 106 described above and shown in Figure 1.
[0050] [0050] In some examples, a mobile network node (such as quadcopter 220) can be configured to function as a UE. For example, quadcopter 220 can function within cell 202 by communicating with base station 210.
[0051] [0051] Under an additional aspect of the RAN 200, sidelink signals can be used between UEs without necessarily depending on programming information or information control from a base station. For example, two or more UEs (such as UEs 226 and 228) can communicate with each other using point-to-point (P2P) or sidelink 227 signals without relaying that communication through a base station (such as , for example, base station 212). In an additional example, UE 238 is shown communicating with UE 240 and 242. Here, UE 238 can function as a programming entity or a primary sidelink device and UE 240 and 242 can function as a programmed entity or a non-primary (such as secondary) sidelink device. In yet another example, a UE can function as a programming entity in a device to device (D2D), point to point (P2P) or vehicle to vehicle (V2V) network and / or a mesh network. In an example of a mesh network, UEs 240 and 242 can optionally communicate directly with each other, in addition to communicating with the programming entity 238. Thus, in a wireless communication system with programmed access to time resources -frequency, and which has a cellular configuration, a P2P configuration or a mesh configuration, a programming entity and one or more programmed entities, can communicate using the programmed resources.
[0052] [0052] In the radio-access network 200, the ability of a UE to communicate while moving, regardless of its location, is referred to as mobility. The various physical channels between the UE and the radio-access network are generally configured, maintained and released under the control of an access and mobility management function (AMF, not shown, part of the basic network 102 in Figure 1). Mobility features can also include a security context management (SCMF) function that manages the security context, both for the control plan and for the user plan functionality, and also for a security anchor function ( SEAF) that performs authentication.
[0053] [0053] Under various aspects of the disclosure, a radio-access network 200 can use DL-based mobility or UL-based mobility to enable mobility and handover (ie transferring a UE connection from a channel radio to another). In a network configured for DL-based mobility, during a call with a programming entity, or at any other time, a UE can monitor several signal parameters from its server cell, as well as several neighboring cell parameters. Depending on the quality of these parameters, the UE can maintain communication with one or more of the neighboring cells. During that time, if the UE moves from one cell to another, or if the signal quality from a neighboring cell exceeds that of the serving cell for a given amount of time, the UE may perform a handoff or handover to from the server cell to the neighboring cell (Target). For example, UE 224 (shown as a vehicle, although any suitable form of UE can be used) can move from the geographic area corresponding to its server cell 202 to the geographic area corresponding to a neighboring cell 206. When the signal strength or quality of neighboring cell 206 exceeds that of its serving cell 202 for a given amount of time, UE 224 may transmit a report message to its serving base station 210 indicating this condition. In response, the UE 224 can receive a handover command and the UE can be handovered to cell 206.
[0054] [0054] In a network configured for UL-based mobility, UL reference signals from each UE can be used by the network to select a server cell for each UE. In some examples, base stations 210, 212 and 214/216 can broadcast unified sync signals (such as unified Primary Sync Signals (PSSs), unified Secondary Sync Signals (SSSs) and Physical Broadcast Channels (PBCH) unified). UEs 222, 224, 226, 228, 230 and 232 can receive the unified sync signals, derive the carrier frequency and partition timing from the sync signals and, in response to the bypass timing, transmit a reference signal or uplink pilot. The uplink pilot signal transmitted by a UE (such as UE 224) can be received concurrently by two or more cells (such as base stations 210 and 214/216) within the radio access network 200. Each cell can measure a pilot signal strength and the radio access network (such as, for example, one or more of base stations 210 and 214/216 and / or a central node within the main network) can determine a server cell for the UE 224. As the UE 224 moves through the radio access network 200, the network can continue to monitor the uplink pilot signal transmitted by the UE 224. When the signal strength or quality of the pilot signal measured by a neighboring cell exceeds the signal strength or quality measured by the server cell, network 200 can handover the UE 224 from the server cell to the neighboring cell, whether or not reporting the UE 224.
[0055] [0055] Although the synchronization signal transmitted by base stations 210, 212 and 214/216 can be unified, the synchronization signal may not identify a specific cell, but instead it can identify a multi-cell zone that operates on the same frequency and / or with the same timing. The use of zones in 5G networks, or other next generation communication networks, enables the uplink-based mobility structure and improves the efficiency of both the UE and the network, since the number of mobility messages that needs to be exchanged between the UE and the network can be reduced.
[0056] [0056] In several implementations, the air interface in the radio-access network 200 can use licensed spectrum, unlicensed spectrum or shared spectrum. The licensed spectrum provides exclusive use of part of the spectrum, usually by virtue of a mobile network operator acquiring a license from a government regulatory body. Unlicensed spectrum provides shared use of part of the spectrum without the need for a government-issued license. Although compliance with some technical rules is still generally required to access the unlicensed spectrum, generally any operator or device can gain access. The shared spectrum can fall between licensed and unlicensed spectrum. Technical rules or limitations may be required to access the spectrum, but the spectrum can still be shared by multiple operators and / or multiple RATs. For example, a license holder for a part of the licensed spectrum may provide licensed shared access (LSA) to share that spectrum with other parties, for example, with appropriate conditions given by the licensee to obtain access.
[0057] [0057] The aerial interface on the radio-access network 200 may use one or more duplexing algorithms. Duplex refers to a point-to-point communication link where the two terminals can communicate with each other in both directions. Full duplex means that the two terminals can communicate simultaneously with each other. Half duplex means that only one terminal can send information to the other at a time. On a wireless link, a full duplex channel generally depends on the physical isolation of a transmitter and receiver and on appropriate interference cancellation technologies. Full duplex emulation is often implemented for wireless links by using Frequency Division Duplex (FDD) or Time Division Duplex (TDD). In FDD, transmissions in different directions work on different carrier frequencies. In TDD, transmissions in different directions on a given channel are separated from each other using time division multiplexing. That is, sometimes the channel is dedicated for transmissions in one direction, while at other times the channel is dedicated for transmissions in the other direction, where the direction can change very quickly, for example, several times per partition.
[0058] [0058] Under some aspects of the disclosure, the programming entity and / or the programmed entity can be configured for beam forming technology and / or multiple-input multiple-outputs (MIMO). Figure 3 shows an example of a wireless communication system 300 that supports MIMO. In a MIMO system, a transmitter 302 includes multiple transmit antennas 304 (such as, for example, N transmit antennas) and a receiver 306 includes multiple receive antennas 308 (such as, for example, M receive antennas). Thus, there are signal paths N x M 310 from the transmitting antennas 304 to the receiving antennas 308. Each of the transmitter 302 and receiver 306 can be implemented, for example, within a programming entity 108, an entity 106 or any other suitable wireless communication device.
[0059] [0059] The use of this technology of multiple antennas allows the wireless communication system to explore the space domain to support spatial multiplexing, beam formation and transmission diversity. Spatial multiplexing can be used to transmit different data streams, also referred to as layers, simultaneously in the same time-frequency resource. Data streams can be transmitted to a single UE to increase the data rate or to multiple UEs to increase the overall system capacity, the latter being referred to as multiple user MIMO (MU-MIMO). This is achieved by spatially pre-coding each data stream (that is, multiplying the data streams with different weights and phase shifts) and then by transmitting each spatially pre-coded stream through multiple transmission antennas on the downlink. The spatially precoded data streams reach the UEs with different spatial signatures, which allows each UE to retrieve the one or more data streams destined for that UE. In the uplink, each UE transmits a spatially precoded data stream, which allows the base station to identify the source of each spatially precoded data stream.
[0060] [0060] The number of data streams or layers corresponds to the classification of the transmission. In general, the MIMO 300 system classification is limited by the number of transmit or receive antennas 304 or 308, whichever is less. In addition, channel conditions in the UE, as well as other considerations, such as the resources available at the base station, can also affect the transmission rating. For example, the rating (and therefore the number of data streams) assigned to a specific UE in the downlink can be given based on the rating indicator (RI) transmitted from the UE to the base station. The RI can be determined based on the antenna configuration (such as the number of transmit and receive antennas) and a signal-to-noise-to-noise (SINR) ratio measured at each of the receiving antennas. The IR can indicate, for example, the number of layers that can be supported under current channel conditions. The base station can use RI, along with resource information (such as available resources and the amount of data to be programmed for the UE), to assign a transmission rating to the UE.
[0061] [0061] In Time Division Duplex (TDD) systems, UL and DL are reciprocal, where each uses different time partitions of the same frequency bandwidth. Therefore, in TDD systems, the base station can assign the rating for DL-MIMO transmissions based on UL-SINR measurements (such as, for example, based on a Reference Sound Signal (SRS) transmitted from the UE or other signal pilot). Based on the assigned rating, the base station can then transmit the CSI-RS with C-RS sequences separated by each layer to provide multi-layer channel estimation. From the CSI-RS, the UE can measure channel quality through layers and resource blocks and feed the channel quality indicator (CQI) and RI values to the base station for use in updating the classification and assignment of REs for future downlink streams.
[0062] [0062] In the simplest case, as shown in Figure 3, a classification-2 spatial multiplexing transmission in a 2x2 MIMO antenna configuration will transmit a data stream from each 304 transmission antenna. Each data stream reaches each receiving antenna 308 along a different signal path
[0063] [0063] Channel encoding can be used so that transmissions through the radio-access network 200 obtain a low rate of block errors (BLER) while still achieving very high data rates. That is, wireless communication can generally use an appropriate error correction block code. In a typical block code, a message or sequence of information is divided into blocks of code (CBs) and an encoder (such as a CODEC) on the transmitting device then mathematically adds redundancy to the information message. The exploitation of this redundancy in the coded information message can improve the reliability of the message, allowing the correction of any bit errors that may occur due to noise.
[0064] [0064] According to the 5G-NR specifications, user data is encoded using the low-density parity check (LDPC) almost cyclic with two different base graphics. One base chart can be used for large blocks of code and / or higher code rates, and another base chart can be used in another way. Of course, other use cases can be implemented with different types of basic graphics combinations. Control information and the physical broadcast channel (PBCH) are encoded using Polar encoding, based on nested strings. For these channels, drilling, shortening and repetition are used for rate matching.
[0065] [0065] However, those skilled in the art will understand which aspects of the present disclosure can be implemented using any suitable channel code. Various implementations of programming entities 108 and programmed entities 106 may include suitable hardware and resources (such as, for example, an encoder, a decoder and / or a CODEC) to use one or more of these channel codes for wireless communication.
[0066] [0066] The aerial interface in the radio-access network 200 may use one or more multiplexing and multiple access algorithms to enable simultaneous communication of the various devices. For example, the 5G-NR specifications provide multiple access for UL transmissions from UEs 222 and 224 to base station 210 and for multiplexing for DL transmissions from base station 210 to one or more UEs 222 and 224 using orthogonal frequency division multiplexing (OFDM) with a cyclic prefix (CP). In addition, for UL transmissions, the 5G-NR specifications provide support for OFDM with discrete scattered Fourrier transform (DFT-s-OFDM) with a CP (also referred to as single carrier FDMA (SC-FDMA)). However, within the scope of the present disclosure, multiplexing and multiple access are not limited to the above schemes, and can be provided using time division multiple access (TDMA), code division multiple access (CDMA),
[0067] [0067] Several aspects of the present disclosure will be described with reference to an OFDM waveform, shown schematically in Figure 4. An air interface can be defined according to a two-dimensional grid of resource elements, defined by the frequency separation of resources, for the definition of a set of subcarriers or frequency tones with short spacing, and for the separation in time by the definition of a sequence of symbols that have a given duration. By setting the pitch between the tones based on the symbol rate, interference between symbols can be eliminated. OFDM channels provide high data rates by allocating a data stream in parallel across multiple subcarriers. It should be understood by those skilled in the art that the various aspects of the present disclosure can be applied to a DFT-s-OFDMA waveform in substantially the same manner as will be described hereinafter. That is, although some examples from the present disclosure maintain focus for clarity on a link
[0068] [0068] Within the present disclosure, frame generally refers to a logical transmission segment of a specific time interval. As a configuration example, a frame can refer to a duration of 10 msec for wireless transmissions, with each frame consisting of 10 subframes of 1 msec each. In a given carrier, there may be a set of frames in the UL and another set of frames in the DL. Referring now to Figure 4, an expanded view of an exemplary DL subframe 402 is shown; it shows a grid of OFDM 404 features. However, as those skilled in the art will readily understand, the PHY transmission structure for any specific application can vary from the example described here, depending on any number of factors. Here, time is in the horizontal direction with units of OFDM symbols; and the frequency is in the vertical direction with units of subcarriers or tones.
[0069] [0069] The 404 resource grid can be used to schematically represent time-frequency resources for a given antenna port. That is, in a MIMO implementation with multiple available antenna ports, a corresponding multiple number of 404 resource grids may be available for communication. The 404 resource grid is divided into multiple 406 resource elements (REs). An ER, which is 1 subcarrier x 1 symbol, is the smallest discrete part of the time-frequency grid and contains a single complex value that represents data from of a physical channel or signal. Depending on the modulation used in a specific implementation, each RE can represent one or more bits of information. In some instances, a block REs may be referred to as a physical resource block (PRB) or more simply a resource block (RB) 408, which contains any suitable number of consecutive subcarriers in the frequency domain. In one example, an RB can include 12 subcarriers, a number independent of the numerology used. In some instances, depending on numerology, an RB may include any suitable number of consecutive OFDM symbols in the time domain. According to some scenarios, it is assumed that a single RB, such as the RB 408, corresponds entirely to a single communication direction (or transmission or reception for a given device).
[0070] [0070] A UE usually uses only a subset of the 404 resource grid. A RB can be the smallest unit of resources that can be allocated to a UE. Thus, the more RBs are programmed for a UE, and the larger the modulation scheme chosen for the air interface, the higher the data rate for the UE.
[0071] [0071] In this illustration, RB 408 is shown to occupy less than the entire bandwidth of subframe 402, with some subcarriers shown above and below RB 408. In a given implementation, subframe 402 can have a bandwidth which corresponds to any number of one or more RBs 408. Furthermore, in this illustration, the RB 408 is shown to occupy less than the entire duration of subframe 402, although this is merely a possible example.
[0072] [0072] Each 1 msec 402 subframe can consist of one or multiple adjacent partitions. In the example shown in Figure 4, a subframe 402 includes four partitions 410, as well as an illustrative example. In some examples, a partition can be defined according to a specified number of OFDM symbols with a given cyclic prefix length (CP). For example, a partition can include 7 or 14 OFDM symbols with a nominal CP. Additional examples may include mini-partitions that are shorter in duration (such as one or two OFDM symbols). These mini-partitions can in some cases be transmitted using resources programmed for partition transfers in progress to the same or to different UEs.
[0073] [0073] An expanded view of one of the partitions 410 shows partition 410 including a control region 412 and a data region 414. In general, control region 412 can carry control channels (such as PDCCH) and data region 414 can carry data channels (such as, for example, PDSCH or PUSCH). Naturally, a partition can contain all DL, all UL or at least one DL part and at least one UL part. The simple structure shown in Figure 4 is merely exemplary in nature, and different partition structures can be used and can include one or more of each of the control regions and data regions.
[0074] [0074] Although not shown in Figure 4, the various REs 406 within an RB 408 can be programmed to carry one or more physical channels, including control channels, shared channels, data channels, etc. Other REs 406 within the RB 408 may also carry pilot or reference signals, which include, but are not limited to, a demodulation reference signal (DMRS), a control reference signal (CRS) or a reference signal polling (SRS). These pilots or reference signals can provide a receiving device to perform the channel estimation of the corresponding channel, which can enable coherent demodulation / detection of the control and / or data channels within the RB 408.
[0075] [0075] The DL 114 control information in Figure 1 will now be described with reference to Figure 4. In a DL transmission, the transmission device (such as programming entity 108) can allocate one or more REs 406 ( as, for example, within a control region 412) to carry DL 114 control information to one or more programmed entities 106. For example, DL 114 control information can be associated with one or more DL control channels, such as as a PBCH; a PSS; an SSS; a physical control format indicator channel (PCFICH); an indicator channel (PHICH) of automatic request for automatic hybrid repetition (HARQ); and / or a physical downlink control channel (PDCCH), etc. The PCFICH provides information to assist a receiving device in receiving and decoding the PDCCH. The PDCCH carries downlink control information (DCI), which includes, but is not limited to, power control commands, programming information, a grant and / or an assignment of REs for DL and UL transmissions. The PHICH carries HARQ feedback transmissions, such as acknowledgment (ACK) or negative acknowledgment (NACK).
[0076] [0076] HARQ is a technique well known to those skilled in the art. When HARQ is implemented, the integrity of packet transmissions can be checked on the receiving side for accuracy, such as using any suitable integrity check mechanism, such as a checksum or cyclic redundancy check ( CRC). If the integrity of the transmission is confirmed, an ACK can be transmitted, while, if not confirmed, a NACK can be transmitted. In response to a NACK, the transmitting device can send an HARQ retransmission, which can implement fetching, incremental redundancy, etc.
[0077] [0077] In a UL transmission, the transmission device (such as programmed entity 106) may use one or more REs 406 to carry UL control information (UCI) 118. UCI 118 may include one or more channels UL control module, such as a physical uplink control channel (PUCCH), for programming entity 108. UCI 118 can include a variety of package types and categories, which include pilots, reference signals and information configured to enable or assist in decoding uplink data transmissions. In some examples, UCI 118 may include a scheduling request (SR), such as a request for scheduling entity 108 to schedule uplink transmissions. Here, in response to the SR transmitted at UCI 118, the programming entity 108 can transmit downlink control information 114 that can program resources for transmissions of uplink packets. The UCI can also include HARQ feedback, channel state feedback (CSF) or any other suitable UCI.
[0078] [0078] In addition to the control information, one or more 406 REs (as, for example, within the data region 414) can be allocated for user data or traffic data. This traffic can be carried on one or more traffic channels, such as for a DL transmission, a physical downlink shared channel (PDSCH); or for a UL transmission, or a shared physical uplink (PUSCH) channel. In some examples, one or more REs 406 within data region 414 can be configured to carry system information blocks (SIBs), which carry information that can enable access to a given cell.
[0079] [0079] The channels or carriers described above, and shown in Figures 1 and 4, are not necessarily all channels or carriers that can be used between a programming entity 108 and programmed entities 106, and those skilled in the art will recognize that others channels or carriers can be used in addition to those shown, such as other traffic, control and feedback channels.
[0080] [0080] These physical channels described above are usually multiplexed and mapped to carry channels for manipulation in the media access control layer (MAC). Transport channels carry blocks of information called transport blocks (TB). The size of the transport block (TBS), which can correspond to a number of bits of information, can be a controlled parameter, based on the modulation and coding scheme (MCS) and the number of RBs in a given transmission.
[0081] [0081] According to one aspect of the revelation,
[0082] [0082] In the example shown, a partition centered on DL can be a programmed transmission partition. The “DL-centric” nomenclature generally refers to a structure in which more resources are allocated for transmissions in the DL direction (such as, for example, transmissions from programming entity 108 to programmed entity 106). Similarly, a UL 550-centered partition can be a programmed receiving partition in which more resources are allocated for transmissions in the UL direction (such as, for example, transmissions from programmed entity 106 to programming entity 108).
[0083] [0083] Each partition, like the autonomous partitions 500 and 550, can include transmitting (Tx) and receiving (Rx) parts. For example, on the DL 500-centered partition, programming entity 202 first has an opportunity to transmit control information, for example, on a PDCCH in a DL 502 control region, and then has an opportunity to transmit data or traffic from DL user, for example, in a PDSCH in a DL 504 data region. After a guard period (GP) region 506 that has an appropriate duration 510, programming entity 108 has an opportunity to receive UL and / or data UL feedback in a UL 508 burst from other entities using the carrier. For example, UL feedback can include any UL, CSF programming request, a HARQ ACK / NACK, etc. The DL 500-centered partition can be referred to as a stand-alone partition when all data ported in data region 504 is programmed in control region 502 of the same partition and when all data ported in data region 504 is recognized (or at least have an opportunity to be recognized) in the UL 508 burst of the same partition. In this way, each autonomous partition can be considered an autonomous entity, not necessarily requiring any other partition to complete a programming-transmission-confirmation cycle for any given package.
[0084] [0084] The GP 506 region can be included to accommodate variability in UL and DL timing. For example, latencies due to radiofrequency (RF) antenna direction switching (such as from DL to UL) and transmission path latencies can cause programmed entity 204 to transmit earlier on UL to match with DL timing. Such early transmission may interfere with the symbols received from the programming entity 108. Therefore, the GP 506 region may allow an amount of time after the DL 504 data region to avoid interference. Therefore, the GP 506 region can be configured to provide an appropriate amount of time for the programming entity 108 to switch its RF antenna direction. The GP 506 region can be further configured to provide an appropriate amount of time for air transmission (OTA) and an appropriate amount of time for ACK processing by the programmed entity.
[0085] [0085] Similarly, the partition centered on UL 550 can be configured as a stand-alone partition. The UL 550-centered partition is substantially similar to the DL 500-centered partition, which includes a DL 551 control region, a guard period 554, an UL 556 data region and a UL 558 burst region.
[0086] [0086] The partition structure shown on partitions 500 and 550 is merely an example of autonomous partitions. Other examples may include a common DL part at the beginning of each partition, and a common UL part at the end of each partition, with several differences in the partition structure between those parts. Other examples can still be provided within the scope of the present disclosure.
[0087] [0087] Figure 6 is a block diagram showing an example of a hardware implementation for a programming entity 600 that uses a 614 processing system. For example, programming entity 600 can be a base station, as shown in any one or more of Figures 1 and / or 2.
[0088] [0088] Programming entity 600 can be implemented with a processing system 614 that includes one or more processors 604. Examples of processors 604 include microprocessors, microcontrollers, digital signal processors (DSP5), field programmable port arrangements (FPGAs ), programmable logic devices (PLDs), state machines, gate-connected logic, discrete hardware circuits and other suitable hardware configured to perform the various features described throughout this disclosure. In several examples, the programming entity 600 can be configured to perform any one or more of the functions described here. That is, processor 604, as used in a programming entity 600, can be used to implement any one or more of the processes described below.
[0089] [0089] In this example, the processing system 614 can be implemented with a bus architecture, usually represented by the bus 602. The bus 602 can include any number of buses and interconnection bridges depending on the specific application of the processing system 614 and the total design restrictions. The bus 602 connects several circuits to each other, including one or more processors (generally represented by the processor 604), a memory 605 and a computer-readable medium (usually represented by a computer-readable medium 606). The 602 bus can also connect several other circuits, such as timing sources, peripherals, voltage regulators and power management circuits, which are well known in the art and, therefore, will not be described further. A bus interface 608 provides an interface between bus 602 and a transceiver 610. Transceiver 610 provides an interface or means of communication for communicating with various other devices via a transmission medium. Depending on the nature of the device, a 612 user interface may also be provided (such as a keyboard, monitor, speaker, microphone, joystick). Of course, this 612 user interface is optional and can be omitted in some examples, such as a base station.
[0090] [0090] Under some aspects of the disclosure, processor 604 may include circuits (such as, for example, circuits 640) configured to perform the various functions described here. The processor 604 is responsible for the management of the bus 602 and for general processing, which includes running the software stored on the computer-readable medium 606. The software, when run by the processor 604, makes the processing system 614 perform the various functions described below for any specific device. Computer-readable medium 606 and memory 605 can also be used to store data that is handled by processor 604 when running the software.
[0091] [0091] One or more 604 processors in the processing system can run software. Software will be widely interpreted as meaning instructions, instruction sets, code, code segments, program code, programs, subprograms, software modules, applications, software applications, software packages, routines, subroutines, objects, executables, execution flows, procedures, functions, etc., whether referred to as software, firmware, middleware, micro-code, hardware description logic or others. The software may reside on a 606 computer-readable medium. The computer-readable medium
[0092] [0092] In one or more examples, the computer-readable storage medium 606 may include software (such as, for example, instructions 652) configured to perform the various functions described here.
[0093] [0093] Figure 7 is a conceptual diagram showing an example of a hardware implementation for an exemplary programmed entity 700 using a 714 processing system. According to various aspects of the disclosure, an element, or any part of an element , or any combination of elements can be implemented with a processing system 714 that includes one or more processors 704. For example, programmed entity 700 can be user equipment (UE), as shown in any one or more of Figures 1 and / or 2.
[0094] [0094] Processing system 714 can be substantially the same processing system 614 shown in Figure 6, which includes a bus interface 708, a bus 702, a memory 705, a processor 704 and a readable medium 707 In addition, programmed entity 700 may include a user interface 712 and a transceiver 710 substantially similar to those described above in Figure
[0095] [0095] Under some aspects of the disclosure, the processor 704 may include information processing circuit 740 configured for various functions, which include, for example, processing the information transmitted from the programming entity in at least one first partition and generating a or more channel state information (CSI) for a number of component carriers. For example, information processing circuit 740 can be configured to implement one or more of the functions described below with respect to Figures 16 and 18, which include, for example, blocks 1602 and / or
[0096] [0096] Processor 704 may include a resource allocation obtaining circuit 742 configured for various functions, which include, for example, obtaining a resource allocation for transmission of a confirmation payload (ACK) / negative confirmation (NACK) using implicit resource mapping based on at least one of a scrambling identifier or one of a plurality of control resource sets (CORESETs). For example, the resource allocation obtaining circuit 742 can be further configured to select one of a plurality of resource groupings associated with one of the plurality of CORESETs for transmitting the ACK / NACK payload.
[0097] [0097] For example, the resource allocation obtaining circuit 742 can be additionally configured to determine an ACK / NACK payload size. For example, the resource allocation obtaining circuit 742 can be additionally configured to obtain a resource allocation to transmit different types of UCI. In such an example, resource allocation can be based on a combination of the different types of UCI. For example, the resource allocation obtaining circuit 742 can be additionally configured to obtain a plurality of DCI formats from the programming entity. In such an example, each of the plurality of DCI formats can include a different amount of information for dynamic programming. For example, the resource allocation obtaining circuit 742 can be additionally configured to obtain an indicator that identifies one of the plurality of DCI formats.
[0098] [0098] For example, the resource allocation obtaining circuit 742 can be additionally configured to obtain a resource allocation for transmission of an ACK / NACK payload. In such an example, resource allocation can be achieved by using an implicit mapping that identifies an uplink control channel resource based on at least one of an initial resource block index, a first displacement index, or a code orthogonal coverage in the time domain (OCC). For example, the resource allocation obtaining circuit 742 can be additionally configured to obtain control information from the programming entity on a control channel. For example, the resource allocation obtaining circuit 742 can be additionally configured to obtain a resource allocation for transmitting an ACK / NACK payload. In such an example, resource allocation can be achieved by mapping one of a plurality of sequences to a transmission based on the ACK / NACK payload sequence. The mapping can vary over time based on one or more parameters. For example, the resource allocation obtaining circuit 742 can be configured to implement one or more of the functions described below, in relation to Figures 12-18, which include, for example, blocks 1202, 1204, 1206, 1302,
[0099] [0099] Processor 704 may include an ACK / NACK 744 payload transmission circuit configured for various functions. In some ways, the ACK / NACK 744 payload transmission circuit can be configured to transmit an ACK / NACK payload based on the resource allocation obtained. In some ways, the ACK / NACK 744 payload transmission circuit can be configured to transmit the different types of UCIs based on the allocation of resources obtained. In some ways, the ACK / NACK 744 payload transmission circuit can be configured to transmit an ACK for control information to the programming entity. For example, the ACK / NACK 744 payload transmission circuit can be configured to implement one or more of the functions described below, in relation to Figures 12-18, which include, for example, blocks 1208, 1304, 1504 , 1704 and / or
[0100] [0100] Processor 704 can include CSI 746 report transmission circuits configured for various functions. These functions may include, for example, transmitting one or more CSI reports to a scheduling entity. For example, the CSI 746 report transmission circuit can be configured to implement one or more of the functions described below, in relation to Figure 16, which include, for example, the block
[0101] [0101] Processor 704 may include the DCI 748 receiving circuit configured for various functions. These functions may include, for example, receiving DCI. DCI can be based on the unit identified from the plurality of DCI formats. For example, the DCI 748 receiving circuit can be configured to implement one or more of the functions described below, in relation to Figure 14, which include, for example, the block
[0102] [0102] In one or more examples, the computer-readable storage medium 706 may include information processing software 750 configured for various functions, which include, for example, processing information transmitted from the programming entity at least least one first partition. For example, information processing software 750 can be additionally configured to generate one or more reports of channel state information (CSI) for a number of component carriers. In some respects, the information processing software 750 can be configured to implement one or more of the functions described above, in relation to Figures 16 and 18, which include, for example, blocks 1602 and / or 1802.
[0103] [0103] In one or more examples, the computer-readable storage medium 706 may include resource allocation obtaining software 752 configured for various functions, which include, for example, obtaining a resource allocation for transmission of a load useful ACK / NACK using implicit resource mapping based on at least one of a scrambling identifier or one of a plurality of CORESETs. For example, the software for obtaining resource allocation
[0104] [0104] For example, the 752 resource allocation obtaining software can be additionally configured to obtain a resource allocation to transmit different types of UCI. In such an example, resource allocation can be based on a combination of the different types of UCI.
[0105] [0105] For example, the resource allocation obtaining software 752 can be additionally configured to obtain a plurality of DCI formats from the programming entity. In such an example, each of the plurality of DCI formats can include a different amount of information for dynamic programming. For example, the resource allocation obtaining software 752 can be additionally configured to obtain an indicator that identifies one of the plurality of DCI formats.
[0106] [0106] For example, the resource allocation obtaining software 752 can be additionally configured to obtain a resource allocation for transmitting an ACK / NACK payload. In such an example, resource allocation can be achieved using an implicit mapping that identifies an uplink control channel resource based on at least one of an initial resource block index, a first displacement index, or an OCC in the time domain. For example, the 752 resource allocation software can be additionally configured to obtain control information from the programming entity on a control channel.
[0107] [0107] For example, the resource allocation obtaining software 752 can be additionally configured to obtain a resource allocation for transmitting an ACK / NACK payload. In such an example, resource allocation can be achieved by mapping to one of a plurality of sequences for a transmission based on the ACK / NACK payload sequence. This mapping can vary over time based on one or more parameters. In some respects, the resource allocation obtaining software 752 can be configured to implement one or more of the functions described above in relation to Figures 12-18, which include, for example, blocks 1202, 1204, 1206, 1302, 1402, 1404, 1502, 1702 and / or 1804.
[0108] [0108] In one or more examples, the computer-readable storage medium 706 may include the ACK / NACK 754 payload transmission software configured for various functions, which include, for example, the transmission of the payload of ACK / NACK based on the allocation of resources obtained. For example, the ACK / NACK 754 payload transmission software can be additionally configured to transmit the different types of UCI based on the resource allocation obtained. For example, the ACK / NACK 754 payload transmission software can be additionally configured to transmit an ACK for control information to the programming entity. In some ways, the ACK / NACK 754 payload transmission software can be configured to implement one or more of the functions described above in relation to Figures 12-18, which include, for example, blocks 1208, 1304, 1504 , 1704 and / or 1806.
[0109] [0109] In one or more examples, the computer-readable storage medium 706 may include CSI 756 report transmission software configured to implement various functions. These functions may include, for example, transmitting the one or more CSI reports to the scheduling entity. For example, CSI 756 reporting software can be configured to implement one or more of the functions described above in relation to Figure 16 which include, for example, block 1604.
[0110] [0110] In one or more examples, the computer-readable storage medium 706 may include DCI reception software 758 configured for various functions, which include, for example, receiving DCI based on the identified unit among a plurality of formats of DCI. For example, the DCI 758 receiving software can be configured to implement one or more of the functions described above in relation to Figure 14, which include, for example, block 1406.
[0111] [0111] The aspects described here can enable a UE, in a wireless network, to obtain a resource allocation more efficiently and without increasing signaling overhead in comparison with conventional techniques. The aspects described here can additionally enable an UE to transmit uplink control information (UCI) to the wireless network more reliably than conventional techniques, by reducing the probabilities of failed UCI transmissions that may result from interference or other factors.
[0112] [0112] A programmed entity can transmit uplink control information (such as, for example, a one-bit ACK / NACK or a two-bit ACK / NACK) using a sequence-based PUCCH transmission. For example, sequence-based PUCCH transmission can be implemented with a Zadoff-Chu sequence (known to those skilled in the art) or another suitable sequence. In one example, the programmed entity can generate a base sequence (also referred to as a root sequence) and one or more cyclic displaced versions of the base sequence. In such an example, in the case of a one-bit ACK / NACK, an ACK can be mapped to a sequence (such as, for example, the base sequence) and a NACK can be mapped to another sequence (such as, for example, a version with cyclic displacement of the base sequence). The programming entity can receive the PUCCH transmission based on the sequence from the programmed entity and can obtain the uplink control information (such as ACK or NACK). For example, the programming entity can identify the sequence in the PUCCH transmission based on the sequence and can determine whether the sequence is mapped to an ACK or a NACK. The disclosure aspects described here involve projects for allocating ACK / NACK resources (such as, for example, sequence selection and RB allocation) and frequency hop settings for PUCCH transmissions (such as, for example, ACK / NACK transmissions ).
[0113] [0113] Under some aspects of the disclosure, the programmed entity can identify a PUCCH resource if the programmed entity obtained a PUCCH format, the initial symbol on a subframe partition, the partitions of a subframe on which the PUCCH can be transmitted and the allocation of blocks of physical resources within the UL bandwidth portion (BWP). The programmed entity may need to obtain additional information to identify a PUCCH resource, depending on the number of UCI bits it needs to transmit. A variety of sample scenarios are discussed below.
[0114] [0114] In a first example scenario, if the programmed entity is going to transmit one or two UCI bits in a short symbol PUCCH resource, the programmed entity may need to obtain the appropriate code / sequence indexes. Otherwise, if the programmed entity is going to transmit more than two UCI bits in a short symbol PUCCH resource, the programmed entity may not need to obtain additional information.
[0115] [0115] In a second example scenario, if the programmed entity is going to transmit one or two UCI bits in a two-symbol short PUCCH resource, the programmed entity may need to obtain the appropriate code / sequence indexes and a jump pattern. frequency. Otherwise, if the programmed entity is going to transmit more than two UCI bits in a short two-symbol PUCCH resource, the programmed entity may need to obtain a frequency hop pattern.
[0116] [0116] In a third example scenario, if the programmed entity is going to transmit one or two UCI bits in a long PUCCH resource, the programmed entity may need to obtain the duration of the long PUCCH resource within a subframe partition (or within multiple partitions of a subframe if the long PUCCH feature is configured on more than one partition), the appropriate sequence / code index (such as, for example, an OCC and a cyclic offset) and a frequency hopping pattern. Otherwise, if the programmed entity is going to transmit more than two UCI bits in a long PUCCH resource, the programmed entity may need to obtain the duration of the long PUCCH resource within a partition of a subframe (or within multiple partitions of a subframe, if the long PUCCH feature is configured in more than one partition) and in a frequency hop pattern. Resource Allocation Type
[0117] [0117] Under several aspects of the disclosure, at least for HARQ-ACK transmission from the programmed entity, a set of PUCCH resources can be configured using explicit signaling or through implicit resource mapping. For example, the programming entity can explicitly identify a set of PUCCH resources by higher layer signaling, by DCI or any other suitable explicit signaling. In another example, the programmed entity can determine a set of PUCCH resources using implicit resource mapping. A programmed entity can determine (as, for example, derive) the set of PUCCH resources from one or more parameters known to the programmed entity. In some ways, a long PUCCH region (also referred to as long-lived PUCCH) can have a variable number of symbols (in some examples, with a minimum of four symbols) in a given partition with a set of supported values. In some ways, a programmed entity can determine the time resource for a long-lived PUCCH on a partition based on an explicit and dynamic indication, a semi-static configuration and / or an implicit determination or combinations of them. For example, when an explicit semi-static configuration is indicated for the programmed entity, the programmed entity can apply or use the semi-static configuration (such as a grant of resources) until a subsequent explicit configuration is received. Therefore, such semi-static configurations can reduce the concession overhead in a network system.
[0118] [0118] Under some aspects of the disclosure, a semi-static resource allocation can be supported by PUCCH. However, resources can be reserved for a relatively long period of time. Therefore, a semi-static resource allocation can be efficient for a scheduling request (SR), where a particular resource may need to be reserved for scheduled entities to initiate a transmission of UL data or periodic control information (such as, for example, Periodic CQI). To reduce the response time of certain high priority programmed entities, the programmed entities can be configured to transmit a storage status report (BSR) with reduced payload on the PUCCH instead of SR. For semi-persistent PDSCH, a semi-static resource allocation to the ACK channel can also reduce concession overhead. On the other hand, uplink control information (such as an ACK) for dynamic PDSCH may not have a predictable transmission pattern and, therefore, semi-static configurations may incur wasted resources.
[0119] [0119] Resource allocations can occur through a variety of approaches. In some ways, to avoid such a waste of resources, resources for dynamic ACK transmission can be allocated to the programmed entity using dynamic resource allocation. Therefore, under some aspects of the disclosure, the type of resource allocation for PUCCH may depend on your uplink control information. In some aspects of the disclosure, the allocation of resources to PUCCH may depend on uplink control information. Under some aspects of disclosure, a programmed entity may support semi-static resource allocation for periodic CQI, SR and / or ACK / NACK for semi-persistent PDSCH. Under some aspects of disclosure, a programmed entity can support dynamic resource allocation at least for ACK / NACK for dynamic PDSCH. ACK / NACK mapping for strings
[0120] [0120] According to various aspects of the disclosure, mapping a one-bit ACK / NACK payload or a two-bit ACK / NACK payload to sequences (such as, for example, a PUCCH transmission with sequence basis) may vary over time based on one or more parameters. Such variation in the mapping can reduce (as, for example, randomly) the interference. In one aspect of the disclosure, the one or more parameters can include an initial / current partition and / or an OFDM symbol index. In another aspect of the disclosure, the one or more parameters may include an identifier of the programmed entity (such as, for example, a UE identifier, such as a temporary radio network identifier (RNTI) or another ID configured for that purpose). In another aspect of the disclosure, the one or more parameters may include a retransmission attempt index identifier or redundancy version (RV).
[0121] [0121] Under some aspects of the disclosure, the mapping can be configurable. In one example, each sequence can be configured individually. In another example, the sequences can be cyclic shifts equally spaced from a common base sequence. The offset spacing and / or the minimum / first offset can be configurable. The settings described above can be implicit or explicit.
[0122] [0122] Under some aspects of the disclosure, different sequences can be configured with different energy shifts (such as, for example, similar to the PUCCH-based shift in the PUCCH energy control). For example, the power of a NACK transmission may need to be greater than the power of an ACK transmission. In such an example, a NACK can be mapped to a first sequence and an ACK can be mapped to a second sequence, where the transmission power configured for the first sequence is greater than the transmission power configured for the second sequence. Entries for Implicit Mapping Function
[0123] [0123] A programmed entity may use an implicit mapping function (also referred to as an implicit mapping rule) to obtain an allocation of resources for a PUCCH transmission (such as ACK / NACK). Under one aspect of the disclosure, an entry for the implicit mapping function may include resource allocation parameters for the PDCCH resource that triggers UCI. For example, such resource allocation parameters may include the control channel element index (CCE) within a CORESET. Resource allocation parameters can additionally include CORESET and the bandwidth share index. In other examples, the resource allocation parameters may additionally include an RNTI used to shuffle the PDCCH.
[0124] [0124] Under another aspect of the disclosure, an entry for the implicit mapping function may include the content of the PDCCH payload that conveys other information. For example, the content of the PDCCH payload can include the details of a scheduled PDSCH resource (such as a resource block (RB) allocation, such as the first RB index or the minimum RB index) , classification, modulation and coding scheme (MCS), waveform, and / or other appropriate information items. For example, the contents of the PDCCH payload may include details of a PDCCH order (such as, for example, semi-persistent programming release (SPS) versus beam switching indicator).
[0125] [0125] Under another aspect of the disclosure, an entry for the implicit mapping function may include the programmed PDSCH content. This can apply to the on-off type of ACK / NACK signaling, such as for the ACK which terminates the contention resolution in a random access channel (RACH) procedure (such as, for example, ACK for 4 messages (Msg4) in a 4-step RACH procedure) Obtaining a Resource Allocation for Transmitting an ACK / NACK Using an Implicit Mapping Function
[0126] [0126] For transmission of one or two bits of ACK channels (such as a transmission, either in a long-term PUCCH or in a short-term PUCCH), a programmed entity can derive an ACK resource using implicit mapping . Under one aspect of the disclosure, the programmed entity can apply an implicit mapping function in which an element of the initial control channel (CCE) of the PDCCH is mapped to a specific ACK resource. Therefore, the programmed entity can determine the initial CCE of the PDCCH and identify the ACK resource. For example, the programmed entity can determine a PUCCH resource (such as, for example, an ACK resource) with the index of rPUCCH, (such as, for example, where 0 ≤ rPUCCH ≤ 15) using equation (1): ( equation 1) where NCCE, 0 represents a number of CCEs in a CORESET of a PDCCH reception that transmits a DCI format (such as DCI format 1_0), NCCE, 0 represents the index of a first CCE for the reception of PDCCH and ΔPRI represents a value (such as a 3-bit value) of the PUCCH resource indicator field included in the DCI (such as, for example, in DCI 1_0 format or in DCI 1_1 format).
[0127] [0127] Under some aspects of the disclosure, PUCCH resources can be grouped into groups of resources. The programmed entity may select a pool of resources based on the PUCCH payload. In some examples of implementations, within each resource grouping, there can be up to 16 PUCCH resources that are indexed in sequence. The allocation of PUCCH resources can include an indication of an index (such as rPUCCH) that corresponds to one of the 16 PUCCH resources. Three bits of this index can be explicitly indicated for the entity programmed in a DL-DCI concession, such as the ΔPRI in equation 1. The programmed entity can determine the remaining bit (such as the fourth bit representing the least bit significant) of the index based on the expression. It should be noted that, since NCCE, 0 can be at most NCCE, 0-1, the result of the expression can be either 0 or
[0128] [0128] Under some aspects of the disclosure, if the network is implementing multiple CORESETs, the programmed entity can apply a resource mapping function that depends on an element index of the initial control channel (CCE) and a singular offset from CORESET. The singular shift of CORESET can prevent collisions of ACK resources in scenarios where multiple programmed entities have the same initial CCE index. For example, the CORESET offset can ensure that programmed entities that monitor different CORESETs are mapped to different ACK resource groupings.
[0129] [0129] Under some aspects of disclosure, collisions of ACK resources can be avoided by including a unique identifier for a programmed entity (also referred to as UE-ID) as an implicit mapping function entry. For example, the unique identifier of a programmed entity may be the nSCID associated with the downlink MU-MIMO transmission. The nSCID can be a scrambling identifier assigned to the programmed entity. For example, adding a single nSCID-based offset over the existing implicit mapping rule can prevent collisions of ACK resources. Different programmed entities in MU-MIMO mode can then be mapped to different groups of resources.
[0130] [0130] Therefore, under some aspects of the disclosure, a programmed entity can support at least implicit mapping of resources from an initial PDCCH CCE index to ACK resources by one or two bits, both in a long-running PUCCH and in a short-lived PUCCH. In some aspects of the disclosure, the programmed entity may receive an indicator of confirmation resources (ARI) (as, for example, in DCI) that indicates the singular shift of CORESET. In some aspects of the disclosure, the programmed entity may receive an ARI (as, for example, in DCI) that indicates the nSCID. In some aspects of the disclosure, the programming entity may transmit an ARI (as, for example, in DCI) to indicate different CORESETs or different nSCID values for different programmed entities.
[0131] [0131] Under some aspects of disclosure, when the programmed entity determines which pool of ACK resources to use, it can proceed to determine the index of ACK resources within the resource pool. The programmed entity can make this determination using a combination of implicit mapping and explicit indication. For a one- or two-bit ACK channel, since a long PUCCH-ACK and a short PUCCH-ACK have different channel structures, as well as different signal-to-noise ratios (SNRs), the PUCCH-ACK features short and long PUCCH-ACK can be orthogonal to each other. Therefore, they can be mapped to different initial PDCCH CCEs. Otherwise, the PDCCH-CCE unit can only be used to program either a long PUCCH-ACK or a short PUCCH-ACK, but not both. This can lead to under-utilization of uplink ACK resources. For example, mapping different
[0132] [0132] Figure 8 (which includes Figures 8A and 8B) shows an example of how the initial resource block index (RB) can be mapped from a PDCCH-CCE index. Figure 8A shows an exemplary subframe 800 and a mapping between a PDCCH 802 and PUCCHs in an uplink region 804. As shown in Figure 8A, the uplink region 804 includes a long-lived region 801 and a short-lived region 803. As further shown in Figure 8A, long-lived PUCCH 806 (also referred to as long-lived PUCCH resources 806) can be mapped from PDCCH 802's 808 resources, long-lived PUCCH 810 (also referred to as PUCCH resources long-term 810) can be mapped from resources 812 of PDCCH 802, and short-term PUCCH 814 (also referred to as short-term PUCCH resources 814) can be mapped from resources 816 of PDCCH 802. A PUCCH long duration in the 804 uplink region can be the same as a long cell specific duration. Cell-specific long and short durations will be described in detail here.
[0133] [0133] Figure 8B shows an exemplary subframe 850 and a mapping between a PDCCH 852 and PUCCHs in an 854 uplink region. As shown in Figure 8B, the 854 uplink region includes a long-lived region 851 and a short-lived region. duration 853. In some aspects of the disclosure, and as shown in Figure 8B, the long PUCCH-ACK channels (such as the resources in the 851 long-duration region) can be multiplexed by time division (such as , shown in Figure 8B as time division multiplexed PUCCH resources 856, 860, 864, 868). In the exemplary configuration of Figure 8B, PUCCH 856 resources can be mapped from PDCCH 852 resources 858, PUCCH 860 resources can be mapped from PDCCH 852 resources, PUCCH 864 resources can be mapped to from resources 866 of PDCCH 852, resources of PUCCH 868 can be mapped from resources 870 of PDCCH 852, resources of PUCCH 872 can be mapped from resources 874 of PDCCH 852 and resources of PUCCH 876 can be mapped from resources 878 of PDCCH 852. As a TDD system has short-lived uplink / downlink reciprocity with PUCCH-ACK (as, for example, as in resources PUCCH 856, 860, 864 and / or 868), the corresponding aggregation level of the PDCCHs may also be lower. In some ways, the programming entity can ensure that no time division of two multiplexed PUCCH-ACK channels in the same resource block is mapped to the same PDCCH-CCE index.
[0134] [0134] The features for long and short ACK transmissions can be configured semi-statically in SIBs. The base sequence index for a PUCCH-ACK can be configured semi-statically in the SIBs or predetermined based on a cell ID. Under some aspects of the disclosure, for a long PUCCH-ACK, the number of RBs can be fixed at one RB. In some aspects of the disclosure, for a short PUCCH-ACK, one, two or four RBs can be supported. In some aspects of the disclosure, the number of RBs may depend on the channel conditions of the programmed entity (such as cell border or cell center). To save overhead, the number of RBs can be configured semi-statically via an RRC configuration. Dynamic programming of a number of RBs can override this default value.
[0135] [0135] In some aspects of the disclosure, the processing times of the programmed entity can be defined in terms of a number of OFDM symbols (such as, for example, N1, N2) along with the absolute time (such as, for example, in microseconds (µs)), instead of partitions (K). For example, N1 can represent the number of OFDM symbols required for the programmed entity to process from the end of NR-PDSCH reception to the earliest possible start of the corresponding ACK / NACK transmission from the perspective of the programmed entity. Therefore, a partition index and an initial symbol index can be derived from the value N1. In some aspects of the disclosure, the processing times of the programmed entity (previously defined as the K1 value) can have a predefined value, which can be replaced dynamically. In some aspects of the disclosure, a semi-static N1 value may have a wider range than dynamic N1 values to simultaneously reduce DCI overhead and support a wider range of N1 values. In some aspects of the disclosure, a dynamic value N1 can be derived from an offset value in relation to the semi-static value N1 to save signaling overhead. The set of permissible displacement values can be signaled to the programmed entity through an RRC configuration. The displacement value assigned can be signaled to the entity programmed in DCI. Therefore, the programmed entity can determine the dynamic N1 value by adding the semi-static N1 value with an indicated dynamic displacement value.
[0136] [0136] In some aspects of the disclosure, the duration of a short PUCCH can be either one or two symbols, which can be either dynamically or semi-statically configured. For a short PUCCH-ACK channel, the use of one or two symbols may depend on the channel conditions of the programmed entity. As such, the duration of the short PUCCH-ACK can be semi-statically configured using an RRC configuration. Dynamic programming of the number of symbols can replace this default value.
[0137] [0137] Under some aspects of the disclosure, the programmed entity can derive the long PUCCH duration in the predefined mode. In the default mode, a final symbol of the long PUCCH can be determined by the starting position of a short-lived uplink. The initial position of the short-lived uplink can be configured semi-statically. Under some aspects of the disclosure, a PUCCH-ACK can span more than one partition to improve coverage. The number of partitions may depend on the programmed entity's link budget. As such, this information can be configured semi-statically through an RRC configuration. The duration of a long PUCCH can be dynamically configured in DCI. In a first example scenario, when a final symbol exceeds the partition limit of an initial symbol, consecutive symbols between the initial symbol and the final symbol can be assigned to programmed entities. In a second example scenario, when the final symbol is within the partition limit of the initial symbol and the number of partitions is greater than one, the same starting and ending symbols per partition can be used within the assigned multiple partitions.
[0138] [0138] Figure 9 (which includes Figures 9A and 9B) shows the first and second example scenarios described previously for a long PUCCH-ACK with aggregated partitions. In both cases, the programmed entity can receive two partitions (such as a first partition and a second partition). Figure 9A shows a subframe 900 in which a starting symbol and an ending symbol are on different partitions. For example, as shown in Figure 9A, the starting symbol (such as having an index value of 2) can be in the first partition 902 and the ending symbol (such as having an index value of 22) it can be in the second partition 904. Therefore, all symbols between the start and end symbols in Figure 9A can be used for the PUCCH-ACK over the programmed entity.
[0139] [0139] Figure 9B shows a subframe 950 in which a starting symbol and an ending symbol are in the same partition. For example, as shown in Figure 9B, the starting symbol (such as having an index value of 2) can be in the first partition 952 and the ending symbol (such as having an index value of 10) it can also be on the first partition 952. The second partition 954 can be configured similarly to the first partition 952. Therefore, as shown in Figure 9B, the programmed entity's long-lived PUCCH-ACK (such as parts 956 and 958 ) may not be continuous. In both partitions, however, the programmed entity can use the same starting and ending symbols so that the symbol indices in subsequent partitions do not need to be flagged. For flexibility, the programming entity can also provide a dynamic configuration of the number of partitions and the number of RBs for the programmed entity.
[0140] [0140] To limit signaling overhead for a multi-partition PUCCH resource, an indication of the initial and final OFDM symbols can be provided together with an indication of the partitions to which they apply and the number of partitions in the assignment. When the initial and final OFDM symbols are on different partitions, the multiple partition feature is contiguous in time from the initial OFDM symbol to the final OFDM symbol. When the start and end OFDM symbols are on the same partition, the resource may not be contiguous in time, with the start and end partitions applied to each partition in the assignment of multiple partitions. Frequency Jump
[0141] [0141] A programmed entity can transmit PUCCH (also known as NR-PUCCH) in at least two different ways. In one example, PUCCH may be short-lived (such as one or two UL-OFDM symbols on a partition). In such an example, the programmed entity can transmit PUCCH at or near the edge of the partition. The PUCCH can be multiplexed by time division or multiplexed by frequency division with the UL data channel (such as, for example, PUSCH) within the same partition. In another example, PUCCH can have a long duration (such as multiple UL-OFDM symbols), in which case the programmed entity can transmit PUCCH at or near the edge of the partition. In this example, PUCCH is multiplexed by frequency division with the UL data channel (such as, for example, PUSCH, which is also referred to as NR-PUSCH) within the same partition.
[0142] [0142] Under some aspects of the disclosure, for a long PUCCH-ACK, a frequency hopping function of the programmed entity can be enabled or disabled through an RRC configuration. The frequency hop can also be enabled or disabled for a short PUCCH with two symbols. To balance the overhead between DCI and programming flexibility, two DCI formats with different payload lengths can be defined. In some ways, the DCI can have a fixed payload (also referred to as a reserve DCI) or a configurable payload (also referred to as a full DCI). In some ways, a short DCI format A0 may include minimal dynamic programming information for a short PUCCH-ACK. In some ways, a long DCI format Al may include more dynamic programming information for the short PUCCH-ACK. An indicator (such as an integer value) can be configured semi-statically in RRC to indicate which format a programmed entity should decode. Alternatively, the indicator can also indicate whether the programmed entity should blindly detect different DCI formats. For example,
[0143] [0143] Examples of the types of information that can be configured semi-statically or dynamically in a programmed entity are described here. In cases where the information is dynamically configured, the examples cover situations in which the dynamic configuration exists by explicit indication or implicit mapping. In a first example, for one or two ACK channel bits, at least the following information can be configured semi-statically in SIBs: resource groupings for different groups (such as CORESETs, MU-MIMO, etc.) ; long and short PUCCH-ACK resource regions within each set; and a base sequence index (if not predetermined).
[0144] [0144] In a second example, the following information can be semi-statically configured using an RRC configuration: a predefined N1 value; the set of N1 values for dynamic indication; a number of RB indices for a short PUCCH-ACK if two RBs or four RBs are supported; a number of symbols for a short PUCCH-ACK; a number of partitions for a long PUCCH-ACK; a frequency jump indicator for a short PUCCH-ACK or a long PUCCH-ACK; and an DCI format indication to inform the programmed entity about which format of
[0145] [0145] For example, the DCI A0 format can indicate a dynamic N1 value (reserve a value to indicate the use of a predefined N1 value) and a confirmation resource indicator (ARI) for different groupings of PUCCH-ACK resources UL. For example, a programmed entity can derive an initial symbol and a partition index from the value N1 and can derive an end symbol from a long PUCCH based on the boundary between a long-lived PUCCH and a short-lived PUCCH. The bit width of the field that carries the dynamic value N1 (such as a classification value) can be given by the set of dynamic values N1. If the set of dynamic values N1 includes a value (or no value), that field may not exist. For example, the bit width of the field that carries the ARI to different groupings of PUCCH-ACK UL resources can be determined by the number of groupings of PUCCH-ACK UL resources in the system.
[0146] [0146] For example, the DCI A1 format can indicate a dynamic N1 value (reserve a value to indicate the use of a predefined N1 value), a final symbol or the number of symbols for either a short PUCCH or a long PUCCH, a number of RBs for a short PUCCH and a number of partitions for a long PUCCH. For example, the programmed entity can derive an initial symbol and a partition index from the value N1. The bit width of the field carrying the dynamic value N1 can be determined by the set of dynamic values N1. If the set of dynamic values N1 includes a value (or no value), that field may not exist. The number of RBs for a short PUCCH can replace a default value of an RRC configuration. The number of partitions for a long PUCCH can replace a default value for an RRC configuration.
[0147] [0147] Under some aspects of disclosure, a programmed entity can use implicit mapping to determine one or more parameters. The one or more parameters can enable the programmed entity to identify UL resources to transmit control information to the network. For example, the one or more parameters can include a long PUCCH region in a subframe or a short PUCCH-ACK region in a subframe.
[0148] [0148] For example, the one or more parameters may additionally include an initial RB index. In some aspects of the disclosure, the initial RB index can be the initial RB index on the first hop if the frequency hop is enabled. The initial RB index for the second hop can be derived based on that initial RB index for the first hop. In some aspects of the disclosure, the allocation of RB to a second hop can be a function of the first hop and possibly other parameters, such as a partition index. In some aspects of the disclosure, an implicit mapping rule can be applied only to the first hop. In some aspects of the disclosure, the implicit mapping function can take into account the number of RBs if two RBs or four RBs are supported.
[0149] [0149] For example, the one or more parameters may additionally include a first displacement index. In some aspects of the disclosure, for a long PUCCH-ACK channel, the first displacement index can be the first displacement index in the first symbol. The remaining displacement indices can be derived based on a predetermined displacement jump pattern. For a short PUCCH-ACK, this means the first displacement index for a short sequence-based ACK. In some aspects of the disclosure, Ns can represent a sequence length and Nb can represent the number of ACK bits. Therefore, in an example, the first displacement index S0 may be in the range of []. The programmed entity can derive the remaining displacement indices in the first symbol based on the distance from the first displacement. Therefore, the displacement index Si for the 1st hypothesis can be determined from equation 2: Si = S0 + i * ds'i = 1, ... 2Nb -1 (equation 2) The programmed entity can determine the indices of offset to the second symbol based on predetermined offset jump rules if the PUCCH is a short two-symbol PUCCH.
[0150] [0150] For example, one or more parameters may additionally include an OCC index in the time domain for a long PUCCH. Under some aspects of the disclosure, for a long PUCCH, the programmed entity can determine the scattering factor and the corresponding OCC sets based on the number of DMRS data and symbols on the partition and whether frequency hopping is enabled.
[0151] [0151] Figure 10 shows an example of an approach for a programmed entity to determine ACK resource information for a short PUCCH-ACK channel specific to a symbol with two bits of ACK and DCI A0 format. Referring to Figure 10, a programmed entity can obtain one or more blocks of system information (SIBs) 1002, which include information 1004. For example, information 1004 can include groupings of resources (such as an indication of a total number of CORESETs, such as four CORESETs), an indication of a long PUCCH-ACK region in a subframe and a short PUCCH-ACK region in a subframe, and a base sequence index (such as 20 ). A programmed entity can additionally obtain an RRC configuration 1006 that includes information 1008. For example, information 1008 can include an N1 value (such as 12), a set of dynamic N1 values, a number of resource blocks ( RBs) (such as, for example, 1), a number of symbols (such as, for example, 1) and a DCI format (such as, for example, DCI A0 format). As shown in Figure 10, the programmed entity can derive information 1010, which includes a partition index and an initial symbol from the value N1. The programmed entity can obtain an indication of a DCI 1012 format, which can be used to decode DCI 1014. DCI 1014 can include 1016 information, which includes a confirmation feature indicator (ARI) that identifies a CORESET (such as, for example, the second CORSESET among the four
[0152] [0152] Under some aspects of the disclosure, at least two DCI formats can be defined with different amounts of information for dynamic programming. In some aspects of the disclosure, an indicator of an RRC configuration can be used to indicate which format should be used for the programmed entity. In some aspects of the disclosure, the following information may be based on the implicit mapping (also known as implicit resource mapping) to PUCCH with one or two bits of ACK bits: a long or short PUCHH region, an initial RB index , a first displacement index and a time domain OCC index for a long PUCCH.
[0153] [0153] Under some aspects of the disclosure, the programmed entity can derive the number of ACK bits to be transmitted based on a number of code words per PDSCH and the number of PDSCHs to be confirmed within a PUCCH channel. The number of PDSCHs to be confirmed may depend on the number of component carriers (CCs) used. For example, if a PDSCH has a codeword, the programmed entity can transmit two ACK bits with two CCs. Since PDSCHs from different partitions can be confirmed on a single PUCCH channel, the number of PDSCHs can also depend on the total number of partitions to be grouped on a single PUCCH channel. For example, if a PDSCH has a codeword, the programmed entity can transmit two ACK bits if it needs to confirm the PDSCH from the current partition and the previous partition concurrently.
[0154] [0154] If the programmed entity does not successfully decode a PDCCH for PDSCH programming, the programmed entity may transmit fewer ACK bits than expected by the programming entity. In order to avoid confusion between the programmed entity and the programming entity in this regard, the programming entity can semi-statically set the number of ACK bits for the programmed entity in up to two ACK bits. For example, the programming entity can configure the programmed entity to transmit only two ACK bits for two code words that are on a single PDSCH. In such a case, if a PDSCH has only one codeword, the programmed entity can package the two ACK bits from the two CCs into a single bit and then transmit them to up to two CCs. The programmed entity can transmit three or more ACK bits without packaging them to three or more CCs. Similarly, the programmed entity can package two PDSCHs from two different partitions into a single ACK bit. The programmed entity can transmit three or more ACK bits without packaging them to three or more PDSCHs. Under some aspects of the disclosure, the programming entity may semi-statically set one or two ACK bits for a programmed entity.
[0155] [0155] When different types of UCI are transmitted simultaneously, the allocation of resources to PUCCH can also be of different types, depending on the combinations of the different types of UCI. For example, if one or two ACK bits are being transmitted together with a periodic CQI on a long-lived PUCCH, the PUCCH can use a CQI resource with an ACK superimposed on the CQI resource. In this case, dynamic resource allocation for an ACK may not be necessary for a dynamic ACK / NACK. If the ACK / NACK transmission is to a semi-static PDSCH, the semi-static ACK resource for that partition can be released to other programmed entities.
[0156] [0156] If a higher ACK bit payload is required, the CQI resource may not be sufficient to transmit the combined UCI. In such cases, a new resource can be allocated dynamically, where the new resource replaces any semi-static resource allocation. The CQI resource or the ACK resource (if semi-persistent) can be released to other entities programmed for that partition. In one aspect of the disclosure, the new resource may include completely new RBs (such as different RBs from a CQI resource or an ACK resource previously allocated in a semi-static manner). In one respect, the new feature can include an extended CQI feature or an extended ACK feature. For example, the extended CQI feature or the extended ACK feature can include additional RBs. Since the ACK and CQI features have different performance objectives, an independent coding scheme can be implemented. This can be achieved with a long PUCCH + a long PUCCH in a TDM way, or a long PUCCH + a short PUCCH in a TDM way, or a short PUCCH + a short PUCCH in a TDM way. In some cases, ACK and CQI resources can also be multiplexed by frequency division in a short burst of uplink within an OFDM symbol.
[0157] [0157] Under some aspects of the disclosure, resources can be allocated to an entity programmed for combined UCI. For example, for single or two-bit ACK / NACK bits, a CQI resource can be allocated to the programmed entity with an ACK overlaid on the CQI resource. As another example, for more ACK payload bits, resources can be dynamically allocated to a programmed entity with different multiplexing options. For example, two NR-PUCCHs can be multiplexed in a TDM manner with a long PUCCH + a long PUCCH, a long PUCCH + a short PUCCH or a short PUCCH + a short PUCCH. For example, two NR-PUCCHs can be multiplexed in an FDM manner in a short burst with an OFDM symbol. In some aspects of the disclosure, a one-bit SR can be included with a multi-bit ACK transmission when the number of ACK bits is greater than a threshold. In some aspects of the disclosure, an SR can be included with other types of UCI. Cell-specific Long and Short PUCCH durations
[0158] [0158] It should be noted that a specific cell long duration can be distinguished from a programmed entity specific long duration.
[0159] [0159] The length of the programmed entity-specific long duration that exceeds the cell-specific long duration will now be described. The duration of long PUCCH UL in a subframe can be affected by both the PDCCH region and the ULSB region. A predefined value of the PDCCH duration can be configured semi-statically by the programming entity, but the actual value of the PDCCH duration can be changed dynamically with any value less than the predefined. The actual PDCCH duration is indicated with a physical control format indicator (PCIFICH). However, a programmed entity may not be necessary to decode the PCIFICH. Therefore, the initial position of the long PUCCH UL duration can be interpreted differently for entities programmed with or without PCIFICH decoding. This can complicate resource management for the programming entity. As there can be scattering in the time domain, if the entities programmed with different starting positions are multiplexed in the same RB, the orthogonality can be broken due to different scattering factors that can be used on the side of the programmed entity. Therefore, a programming entity may need to separate a first set of programmed entities that decode PCIFICH from a second set of programmed entities that do not decode PCIFICH and assign the first and second sets of programmed entities to different RBs.
[0160] [0160] Under some aspects of the disclosure, a programming entity may receive feedback from the programmed entities according to its PCIFICH decoding behavior. This feedback can enable the separation described above from the first and second sets of programmed entities. This feedback can additionally allow PUCCH decoding from programmed entities with different lengths of long PUCCH. Such use of feedback from programmed entities, however, can add some overhead. In some aspects of the disclosure, a PCIFICH decoding failure can lead to a PUCCH decoding failure due to an assumption of an incorrect initial position in a programmed entity and in the programming entity. Alternatively, the starting position of a PUCCH can be configured semi-statically. This is possible because, for any programmed entity, regardless of whether PCIFICH is decoded, PUCCH can always start from the predefined position, under some aspects of the disclosure. The PUCCH transmission may not extend to a predefined PDCCH + GAP region, even if the actual number of PDCCH symbols is less. In one approach, a programmed entity-specific long duration can be restricted to prevent extension to a PDCCH + GAP region, which can substantially simplify the objects of both the programming entity and the programmed entity. This approach, however, can result in a waste of PUCCH-RBs in an unused PDCCH region.
[0161] [0161] The programmed entity-specific long PUCCH duration can also be affected by the ULSB. The ULSB can have one or two normal symbol durations. Both TDM and FDM between a short-lived PUCCH and a long-lived PUCCH can be supported, at least for different entities programmed into a partition. For example, frequency division multiplexing (FDM) between a short PUCCH duration and a long PUCCH duration can result in a possible extension of a long PUCCH duration to the ULSB region. This may be acceptable when the extent is semi-static (as, for example, where the long PUCCH duration extends to the ULSB region only when the entire ULSB region occupies a subset of the broadband bandwidth). However, when a dynamic long PUCCH extension is extended, programmed entities may need to monitor the PDCCH to see if the extension is allowed or not. This can be undesirable when the implicit mapping or semi-static configuration of a PUCCH resource is used. In addition, if a dynamic configuration of a PUCCH duration is allowed, this can also increase energy consumption in the programmed entity. The programmed entity may not have enough time to process a PDCCH, decode a DCI that contains a PUCCH duration, and apply the decoded information to a PUCCH transmission on the same partition. Therefore, a programmed entity may need to anticipate just to decode the PDCCH and determine the configured PUCCH duration, which can result in higher energy consumption at the programmed entity. Therefore, in some aspects of the disclosure, a programmed entity-specific long duration cannot exceed a specific cell long duration, as shown in Figure 11. Briefly, Figure 11 shows a subframe 1102 that includes a predefined PDCCH region 1104 and a uplink region that includes a long burst region 1106 and a short burst region 1108. Figure 11 additionally shows a real PDCCH 1110, long PUCCH durations 1112, 1114 and an ULSB 1116. As shown in Figure 11, ULSB 1116 it can be within the predefined ULSB region 1118. For example, long PUCCH durations 1112, 1114 can be programmed entity-specific long durations that do not exceed a specific long cell duration.
[0162] [0162] Under some aspects of the disclosure, a specific short cell duration can be configured semi-statically. In some aspects of the disclosure, a specific cell long duration can be derived based on a partition duration, a semi-static PDCCH region, a specific cell short duration and a GAP (such as a guard period ). In some aspects of the disclosure, the programmed entity-specific short PUCCH duration may be a subset of the specific cell short duration, but cannot exceed the specific cell short duration. In some aspects of the disclosure, the programmed entity-specific long PUCCH duration may be a subset of the cell-specific long duration, but it cannot exceed the cell-specific long duration.
[0163] [0163] Under some aspects of the disclosure, there may be multiple parts of DL / UL bandwidth (BWPs). For example, each BWP can have a different PDCCH region. In some aspects of the disclosure, different uplink BWPs can have different start positions, even when a semi-static configured start position of a long-lived PUCCH is used. When a programmed entity needs to transmit PUCCH concomitantly to different uplink BWPs, the PUCCH to different uplink BWPs can start with different symbols. This can cause problems with power control and maintaining phase continuity when the last PUCCH is started. The same is also true for having different final symbols. Such problems can be avoided by using the same initial symbols for PUCCH over a long duration for different uplink BWPs. Therefore, under some aspects of the disclosure, a programmed entity can support the same initial and final symbols for programmed entity-specific long PUCCH in different uplink BWPs.
[0164] [0164] In NR, a programmed entity may need to deliver large UCI payloads. For example, such large UCI payloads can result from multi-bit ACKs and multi-bit SRs. A subband CQI report may have more payload bits due to increased bandwidth bandwidth. A CSI report may also need to include beam-related information. When a programmed entity implements carrier aggregation, the size of the UCI payload can be scaled with the number of carriers. In some respects, the NR can support up to 16 component carriers (CCs) and there may be fewer CCs if larger component carriers are used. For example, a large UCI payload can include more than 600 bits of payload. On the other hand, a polar code can have up to N = 1024 bits of output, which means that a single polar code word may not be sufficient for a large payload size (such as more than 600 bits). In some aspects of the disclosure, the number of UCI payload bits that a programmed entity can transmit can be limited to achieve a reduction in the large UCI payloads described above. Therefore, in such respects, the number of concurrent CCs within a CSI report can be limited to reduce an UCI payload. In some aspects of the disclosure, the number of concurrent CCs within a CSI report can be limited to five CCs for a spectrum band below approximately 6.0 gigahertz (GHz) (also known as “sub-6”) and 10 CCs by a millimeter of wave spectrum (mmWave).
[0165] [0165] LTE can support semi-persistent programming (SPS). In LTE, the PDCCH that indicates the release of an SPS assignment can be confirmed by a programmed entity. This allows the scheduling entity to confirm that the scheduled entity has released the assignment before assigning the SPS resources to other scheduled entities.
[0166] [0166] Examples of options for implicit or explicit signaling will now be described. In one aspect of the disclosure, for long-term PUCCH transmissions that carry only ACKs, the programmed entity can implicitly determine the RB index, cyclic displacement or spacing index, and the OCC. For example, the start and end OFDM (or start and duration) uplink symbols can be set to a predefined value (such as, based on a partition format indicator) in the programmed entity. Alternatively, the DCI may indicate an explicit replacement for any default value. In another aspect of the disclosure, for short-lived PUCCH, the number of uplink OFDM symbols (such as, for example, one or two OFDM symbols) to be used by the programmed entity can be configured semi-statically or dynamically. In another aspect of the disclosure, implicit mapping can map one set of PDCCH or CCE resources to a short PUCCH and another set to a long PUCCH. In another aspect, the CCE indexing order can be randomized before the implicit mapping of the CCE index to the PUCCH resource. Such randomization can, for example, be a function of the partition index and can help to reduce the probability of blocking or collision for the programmer.
[0167] [0167] Figure 12 is a flow chart showing an exemplary 1200 process for a programmed entity to communicate with a programming entity on a wireless communication network in accordance with some aspects of the present disclosure. As described below, some or all of the features shown may be omitted in a specific implementation within the scope of the present disclosure, and some features shown may not be necessary for the implementation of all modalities. In some examples, process 1200 can be performed by programmed entity 700 shown in Figure
[0168] [0168] In block 1202, the programmed entity obtains an allocation of resources for the transmission of an ACK / NACK payload using implicit mapping of resources based on at least one of a scrambling identifier or one among a plurality of CORESETs. In block 1204, the programmed entity determines an ACK / NACK payload size. In block 1206, the programmed entity selects one from a plurality of resource groupings associated with one from the plurality of CORESETs for transmitting the ACK / NACK payload. In block 1208, the programmed entity transmits the ACK / NACK payload based on the resource allocation obtained. In some aspects of the disclosure, implicit resource mapping is additionally based on an initial control channel (CCE) element of a downlink control channel. In some aspects of the disclosure, the one among the plurality of CORESETs is associated with a single shift to be applied from the initial CCE.
[0169] [0169] Figure 13 is a flow chart showing an exemplary 1300 process for a programmed entity to communicate with a programming entity on a wireless communication network in accordance with some aspects of the present disclosure. As described below, some or all of the features shown may be omitted in a specific implementation within the scope of the present disclosure, and some features shown may not be necessary for the implementation of all modalities. In some examples, process 1300 can be performed by programmed entity 700 shown in Figure
[0170] [0170] In block 1302, the programmed entity obtains an allocation of resources to transmit different types of UCI based on a combination of the different types of UCI. In block 1304, the programmed entity transmits the different types of UCIs based on the allocation of resources obtained. In some aspects of the disclosure, the different types of UCI include a channel quality indicator (CQI) and one or more ACK / NACK bits. Under such aspects of disclosure, the one or more ACK / NACK bits are transmitted using resources allocated to the CQI. In one aspect of the disclosure, the different types of UCIs include a plurality of ACK bits and a one-bit programming request. In such aspects of disclosure, the one-bit programming request is transmitted with the plurality of ACK bits when the plurality of ACK bits exceeds a threshold.
[0171] [0171] Figure 14 is a flow chart showing an exemplary process 1400 for a programmed entity to communicate with a programming entity on a wireless communication network in accordance with some aspects of the present disclosure. As described below, some or all of the features shown may be omitted in a specific implementation within the scope of the present disclosure, and some features shown may not be necessary for the implementation of all modalities. In some examples, process 1400 can be performed by programmed entity 700 shown in Figure
[0172] [0172] In block 1402, the programmed entity obtains a plurality of DCI formats from the programmed entity. Each of the plurality of DCI formats can include a different amount of information for dynamic programming. In block 1404, the programmed entity obtains an indicator that identifies one of the plurality of DCI formats. In block 1406, the programmed entity receives the DCI based on the unit identified from the plurality of DCI formats. In some aspects of the disclosure, the indicator is obtained in a radio resource configuration (RRC) message from the programming entity. Under some aspects of disclosure, each of the plurality of DCI formats includes a different number of information fields, each of the information fields being associated with a distinct characteristic.
[0173] [0173] Figure 15 is a flow chart showing an exemplary 1500 process for a programmed entity to communicate with a programming entity on a wireless communication network in accordance with some aspects of the present disclosure. As described below, some or all of the features shown may be omitted in a specific implementation within the scope of the present disclosure, and some features shown may not be necessary for the implementation of all modalities. In some examples, process 1500 can be performed by programmed entity 700 shown in Figure
[0174] [0174] In block 1502, the programmed entity obtains an allocation of resources for the transmission of an ACK / NACK payload. Resource allocation is achieved using an implicit mapping that identifies an uplink control channel resource based on at least one of an initial resource block index, a first displacement index, or a time domain OCC. In block 1504, the programmed entity transmits the ACK / NACK payload based on the resource allocation obtained. In some aspects of the disclosure, the initial index of the resource block is included in a first hop when the frequency hop is enabled. In some aspects of the disclosure, the first index of displacement is included in the first symbol of a subframe. In some aspects of the disclosure, the orthogonal coverage code is derived based on a number of data and demodulation reference signal (DMRS) symbols on a subframe partition and whether frequency hopping is enabled.
[0175] [0175] Figure 16 is a flow chart showing an exemplary 1600 process for a programmed entity to communicate with a programming entity on a wireless communication network in accordance with some aspects of the present disclosure. As described below, some or all of the features shown may be omitted in a specific implementation within the scope of the present disclosure, and some features shown may not be necessary for the implementation of all modalities. In some examples, process 1600 can be performed by programmed entity 700 shown in Figure
[0176] [0176] In block 1602, the programmed entity generates one or more reports of channel state information (CSI) for a number of component carriers. Under some aspects of disclosure, the programmed entity may generate a CSI report for a number of component carriers when the number of component carriers is less than or equal to a threshold. In one example, the limit can be five component carriers when a spectrum band below approximately 6.0 gigahertz is used. In another example, the limit can be 10 component carriers when a millimeter wave spectrum is used. In block 1604, the programmed entity transmits one or more CSI reports to the programming entity.
[0177] [0177] Figure 17 is a flow chart showing an exemplary 1700 process for a programmed entity to communicate with a programming entity on a wireless communication network in accordance with some aspects of the present disclosure. As described below, some or all of the features shown may be omitted in a specific implementation within the scope of the present disclosure, and some features shown may not be necessary for the implementation of all modalities. In some examples, process 1700 can be performed by programmed entity 700 shown in Figure
[0178] [0178] In block 1702, the programmed entity obtains control information from the programming entity in a control channel. In block 1704, the programmed entity transmits an ACK for the control information to the programming entity. In some aspects of the disclosure, the control information includes an indication to perform an operation on the programmed entity. In some aspects of the disclosure, the operation is a beam switching operation. In some aspects of disclosure, the control information has a priority value that exceeds a threshold priority value.
[0179] [0179] Figure 18 is a flow chart showing an exemplary 1800 process for a programmed entity to communicate with a programming entity on a wireless communication network in accordance with some aspects of the present disclosure. As described below, some or all of the features shown may be omitted in a specific implementation within the scope of the present disclosure, and some features shown may not be necessary for the implementation of all modalities. In some examples, process 1800 can be performed by programmed entity 700 shown in Figure
[0180] [0180] In block 1802, the programmed entity optionally processes the information transmitted from the programming entity in at least one first partition. In block 1804, the programmed entity obtains an allocation of resources for the transmission of an ACK / NACK payload. The programmed entity obtains the allocation of resources by mapping one of a plurality of sequences to a transmission based on the ACK / NACK payload sequence. In some ways, the mapping varies over time based on one or more parameters. In some aspects of the disclosure, the ACK / NACK payload is associated with the information on at least the first partition. In block 1806, the programmed entity transmits the ACK / NACK payload based on the allocation of resources obtained.
[0181] [0181] Under some aspects of the disclosure, the one or more parameters include at least one of an initial partition, a current partition, an orthogonal frequency division multiplexing symbol index (OFDM), a programmed entity identifier, an index retransmission attempts or a redundancy (RV) version identifier.
[0182] [0182] Under some aspects of the disclosure, each of the plurality of strings is individually configured based on an implicit or explicit configuration. In some aspects of the disclosure, the plurality of sequences are cyclic shifts equally spaced from a common base sequence. In some aspects of the disclosure, at least one of an offset spacing for evenly spaced cyclic offsets or a minimum offset for equally spaced cyclic offsets is configured based on an implicit or explicit configuration. Under some aspects of the disclosure, one or more of the plurality of sequences are configured with different energy shifts.
[0183] [0183] Under some aspects of the disclosure, the mapping is based on an implicit mapping function that is implemented using one or more function entries. In one example, the one or more role entries may include a resource allocation parameter for a downlink control channel resource that triggers the payload content of the UCL downlink control channel and / or the content of a programmed downlink shared channel. In some aspects of the disclosure, the resource allocation parameter includes at least one of a control channel element index (CCE) within a CORESET, a CORESET index, a bandwidth part index or a temporary identifier radio network (RNTI) to scramble the downlink control channel. In another example, the one or more function entries can include shared downlink channel content or downlink control channel payload content. In some aspects of the disclosure, the payload content of the downlink control channel may include information from a programmed downlink shared channel resource, a rating, a modulation and encoding scheme (MCS), a waveform and / or details of a downlink control channel order or instruction.
[0184] [0184] In a configuration example, the handset 700 for wireless communication may include means to obtain an allocation of resources for transmitting an ACK / NACK payload using implicit resource mapping based on at least one of a scrambling identifier or one of multiple CORESETs. Apparatus 700 may additionally include means for determining an ACK / NACK payload size. The apparatus 700 may additionally include means for selecting one from a plurality of resource sets associated with one from the plurality of CORESETs for transmitting the ACK / NACK payload. The apparatus 700 may additionally include means for transmitting the ACK / NACK payload based on the resource allocation obtained.
[0185] [0185] In another example of configuration, the device 700 for wireless communication may include means to obtain an allocation of resources to transmit different types of UCI. For example, resource allocation can be based on a combination of the different types of UCI. The apparatus 700 may additionally include means for transmitting the different types of UCIs based on the allocation of resources obtained.
[0186] [0186] In another example of configuration, the apparatus 700 for wireless communication may include means for obtaining a plurality of DCI formats from the programming entity. For example, each of the plurality of DCI formats can include a different amount of information for dynamic programming. Apparatus 700 may additionally include means for obtaining an indicator that identifies one of the plurality of DCI formats. The apparatus 700 may additionally include means for receiving DCI based on the identified unit among the plurality of DCI formats.
[0187] [0187] In another example of configuration, the device 700 for wireless communication may include means to obtain an allocation of resources for transmitting an ACK / NACK payload. For example, resource allocation can be achieved using an implicit mapping that identifies an uplink control channel resource based on at least one of an initial resource block index, a first displacement index, or an OCC in the time domain. The apparatus 700 may additionally include means for transmitting the ACK / NACK payload based on the resource allocation obtained.
[0188] [0188] In another example of configuration, the apparatus 700 for wireless communication may include means for generating one or more reports of channel state information (CSI) for a number of component carriers. Apparatus 700 may additionally include means for transmitting one or more CSI reports to the programming entity.
[0189] [0189] In another example of configuration, the device 700 for wireless communication may include means to obtain control information from the programming entity on a control channel. The apparatus 700 may additionally include means for transmitting an ACK for the control information to the programming entity.
[0190] [0190] In another example of configuration, the apparatus 700 for wireless communication may include means for processing information transmitted from the programming entity in at least one first partition. The apparatus 700 may additionally include means for obtaining a resource allocation for transmitting an ACK / NACK payload. For example, resource allocation can be achieved by mapping to one of a plurality of sequences for a transmission based on the ACK / NACK payload sequence. The mapping can vary over time based on one or more parameters. The apparatus 700 may additionally include means for transmitting the ACK / NACK payload based on the resource allocation obtained.
[0191] [0191] In one aspect of the disclosure, the aforementioned means may be processors 704 configured to perform the functions enumerated by the means mentioned above. In another aspect, the aforementioned means can be a circuit or any apparatus configured to perform the functions enumerated by the means mentioned above.
[0192] [0192] Of course, in the examples above, the circuit included in processor 704 is merely presented as an example, and other means to perform the functions described can be included within various aspects of the present disclosure, which include, but are not limited to, instructions stored in the computer-readable storage medium 706, or any other suitable device or medium described in any one of Figures 1 and / or 2, and which uses, for example, the processes and / or algorithms described here in relation to Figures 12-18.
[0193] [0193] Several aspects of a wireless communication network have been presented with reference to an exemplary implementation. As those skilled in the art will readily understand, several aspects described throughout this disclosure can be extended to other telecommunications systems, network architectures and communication standards.
[0194] [0194] As an example, several aspects can be implemented in other systems defined by 3GPP, such as Long Term Evolution (LTE), the Evolved Packet System (EPS), the Universal Mobile Telecommunications System (UMTS) and / or the Global System for Cell Phones (GSM). Several aspects can also be extended to the systems defined by the 3rd Generation Partnership Project 2 (3GPP2), such as CDMA2000 and / or Evolution-Data Optimized (EV-DO). Other examples can be implemented in systems that use IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, Ultra-Broadband (UWB), Bluetooth and / or other suitable systems. The actual telecommunications standard, network architecture and / or communication standard used will depend on the specific application and the general design restrictions imposed on the system as a whole.
[0195] [0195] Within the present revelation, the word "exemplary" is used to mean "to serve as an example, instance or illustration". Any implementation or aspect described herein as "exemplary" should not necessarily be interpreted as preferred or advantageous over other aspects of the disclosure. Likewise, the term "aspects" does not require that all aspects of the disclosure include characteristics, advantages or modes of operation discussed. The term “coupled” is used here to refer to the direct or indirect coupling between two objects. For example, if object A physically touches object B, and object B touches object C, objects A and C can still be considered coupled to each other - even if they do not touch each other directly and physically. For example, a first object can be attached to a second object, even if the first object is never directly and physically in contact with the second object. The terms "circuit" (circuit) and "circuit" (circuitry) are widely used and are intended to include hardware implementations of electrical devices and conductors that, when connected and configured, allow the performance of the functions described in this disclosure, without limitation as to the type of electronic circuits, as well as software implementations of information and instructions that, when executed by a processor, enable the performance of the functions described in the present disclosure. As used herein, the term "obtain" may include one or more shares, which include, but are not limited to, receiving, acquiring, determining or any combination thereof.
[0196] [0196] One or more of the components, steps, features, and / or functions illustrated in Figures 1-18 can be rearranged and / or combined into a single component, step, feature or function or embodied in several components, steps or functions. Additional elements, components, steps and / or functions can also be added without abandoning the new features revealed here. The apparatus, devices and / or components shown in Figures 1-18 can be configured to perform one or more of the methods, resources or steps described here. The new algorithms described here can also be implemented efficiently in software and / or embodied in hardware.
[0197] [0197] It should be understood that the specific order or hierarchy of steps in the revealed methods is an illustration of exemplary processes. Based on the design preferences, it should be understood that the specific order or hierarchy of steps in the methods can be reset. The attached method claims present elements of the various steps in a sample order, and are not intended to be limited to the specific order or hierarchy presented, unless specifically listed here.

权利要求:
Claims (42)
[1]
1. Method for a programmed entity to communicate with a programming entity on a wireless communication network, the method comprising: obtaining an allocation of resources for transmission of a confirmation payload (ACK) / negative confirmation (NACK) using whether the implicit mapping of resources based on at least one of a scrambling identifier or one among a plurality of control resource sets (CORESETs); and transmit the ACK / NACK payload based on the resource allocation obtained.
[2]
2. Method according to claim 1, in which the implicit mapping of resources is additionally based on an initial control channel element (CCE) of a downlink control channel, and in which the one among the plurality of sets control resources (CORESETs) is associated with a single offset to be applied from the initial CCE.
[3]
3. Method according to claim 1, which further comprises: selecting one of a plurality of resource groupings associated with one of the plurality of control resource sets (CORESETs) for transmitting the ACK / NACK payload.
[4]
4. Method according to claim 1, which further comprises: selecting one from a plurality of resource groupings based on the size of an ACK / NACK payload.
[5]
5. Method, according to claim 1, in which at least one of the scrambling identifiers or the one among the plurality of control resource sets (CORESETs) is indicated in a confirmation resources indicator (ARI) in information of downlink control (DCI).
[6]
6. Apparatus for wireless communication, comprising: at least one processor: a transceiver coupled communicatively to at least one processor; and a memory communicatively coupled to at least one processor, where at least one processor is configured to: obtain an allocation of resources for transmission of a confirmation payload (ACK) / negative confirmation (NACK) using implicit mapping resource based on at least one of a scrambling identifier or one of a plurality of control resource sets (CORESETs); and transmit the ACK / NACK payload based on the resource allocation obtained.
[7]
7. Apparatus according to claim 6, in which the implicit mapping of resources is additionally based on an initial control channel (CCE) element of a downlink control channel, and in which the one among the plurality of sets control resources (CORESETs) is associated with a single offset to be applied from the initial CCE.
[8]
8. Apparatus according to claim 6, wherein the at least one processor is additionally configured to: select one of a plurality of resource groupings associated with one of the plurality of control resource sets (CORESETs) for transmission of the ACK / NACK payload.
[9]
Apparatus according to claim 6, wherein the at least one processor is additionally configured to: select one from a plurality of resource groupings based on the size of an ACK / NACK payload.
[10]
10. Apparatus according to claim 6, in which at least one of the scrambling identifiers or one of the plurality of control resource sets (CORESETs) is indicated in a confirmation resource indicator (ARI) in information of downlink control (DCI).
[11]
11. Medium that can be read by a non-transitory computer that stores executable code by computer, it comprises a code to make a computer: obtain an allocation of resources to transmit a confirmation payload (ACK) / negative confirmation (NACK) using the implicit mapping of resources based on at least one of a scrambling identifier or one of a plurality of control resource sets (CORESETs); and transmit the ACK / NACK payload based on the resource allocation obtained.
[12]
12. Apparatus for wireless communication, comprising: means to obtain an allocation of resources for transmission of a confirmation payload (ACK) / negative confirmation (NACK) using implicit mapping of resources based on at least one of a scrambling identifier or one of a plurality of control resource sets (CORESETs); and means for transmitting the ACK / NACK payload based on the allocation of resources obtained.
[13]
13. Apparatus according to claim 12, which further comprises: means for selecting one of a plurality of resource groupings associated with the one of a plurality of control resource sets (CORESETs) for transmitting the ACK / NACK payload .
[14]
Apparatus according to claim 12, which further comprises: means for selecting one from a plurality of resource groupings based on the size of an ACK / NACK payload.
[15]
15. Method for a programmed entity to communicate with a programming entity on a wireless communication network, the method comprising: obtaining an allocation of resources for transmission of a confirmation payload (ACK) / negative confirmation (NACK), in that resource allocation is achieved by mapping to one of a plurality of streams for a transmission based on
ACK / NACK, where the mapping varies with time based on one or more parameters; and transmit the ACK / NACK payload based on the resource allocation obtained.
[16]
16. The method of claim 15, wherein the one or more parameters include at least one of an initial partition, a current partition, an orthogonal frequency division multiplexing symbol index (OFDM), an entity identifier program, an index of retransmission attempts, or a redundancy version identifier (RV).
[17]
17. The method of claim 15, wherein each of the plurality of strings is individually configured based on an implicit or explicit configuration.
[18]
18. The method of claim 16, wherein the plurality of sequences are cyclic shifts equally spaced from a common base sequence.
[19]
19. The method of claim 15, wherein one or more of the plurality of sequences are configured with different energy shifts.
[20]
20. Method according to claim 15, in which the mapping is based on an implicit mapping function that is implemented using one or more function entries, where the one or more function entries include at least one of a resource allocation parameter for a downlink control channel resource that triggers uplink control information (UCI), the content of the downlink control channel payload, the resource allocation of a programmed downlink shared channel or the content of the scheduled downlink shared channel.
[21]
21. The method of claim 15, wherein the at least one resource allocation parameter includes at least one of a control channel element index (CCE) within a control resource set (CORESET), a CORESET index, an index of part of the bandwidth or a temporary radio network identifier (RNTI) to scramble the downlink control channel.
[22]
22. The method of claim 15, wherein the mapping is based on an implicit mapping function that is implemented using one or more function entries, where the one or more function entries include at least one of shared downlink channel content or downlink control channel payload content.
[23]
23. The method of claim 22, wherein the payload content of the downlink control channel includes at least one information from a programmed downlink shared channel resource, a rating, a modulation and encoding scheme ( MCS), a waveform or details of a downlink control channel order or instruction.
[24]
24. The method of claim 15, further comprising: processing information transmitted from the programming entity on at least one first partition, wherein the ACK / NACK payload is associated with the information on the at least first partition .
[25]
25. Method according to claim 15, wherein the ACK / NACK payload is transmitted using frequency hopping based on a radio resource configuration from the programming entity.
[26]
26. The method of claim 25, wherein a resource block allocation for a second frequency hop is a function of at least one resource block allocation for a first frequency hop.
[27]
27. The method of claim 25, wherein a resource block allocation for a second frequency hop is a function of a resource block allocation of a first frequency hop and a partition index.
[28]
28. Apparatus for wireless communication, comprising: at least one processor; a transceiver coupled communicatively to at least one processor; and a memory communicatively coupled to at least one processor, where the at least one processor is configured to: obtain an allocation of resources for transmission of a confirmation payload (ACK) / negative confirmation (NACK), in which the allocation of resources are obtained by mapping to one of a plurality of sequences for a transmission based on the ACK / NACK payload sequence, in which the mapping varies with time based on one or more parameters; and transmit the ACK / NACK payload based on the resource allocation obtained.
[29]
29. Apparatus according to claim 28, wherein the one or more parameters include at least one of an initial partition, a current partition, an index of orthogonal frequency division multiplexing symbols (OFDM), an entity identifier program, an index of retransmission attempts, or a redundancy version identifier (RV).
[30]
Apparatus according to claim 29, wherein the plurality of sequences are cyclic displacements equally spaced from a common base sequence.
[31]
31. Apparatus according to claim 28, wherein one or more of the plurality of sequences are configured with different energy shifts.
[32]
32. Apparatus according to claim 28, wherein the mapping is based on an implicit mapping function that is implemented using one or more function entries, where the one or more function entries include at least one of a resource allocation parameter for a downlink control channel resource that triggers uplink control information (UCI), the content of the downlink control channel payload, the resource allocation of a programmed downlink shared channel or the content of the scheduled downlink shared channel.
[33]
33. Apparatus according to claim 28, wherein the at least one resource allocation parameter includes at least one of a control channel element index (CCE) within a control resource set (CORESET), a CORESET index, an index of part of the bandwidth or a temporary radio network identifier (RNTI) to scramble the downlink control channel.
[34]
34. Apparatus according to claim 28, wherein the mapping is based on an implicit mapping function that is implemented using one or more function entries, where the one or more function entries include at least one of shared downlink channel content or downlink control channel payload content.
[35]
35. Apparatus according to claim 34, wherein the payload content of the downlink control channel includes at least one information from a programmed downlink shared channel resource, a rating, a modulation and encoding scheme ( MCS), a waveform or details of a downlink control channel order or instruction.
[36]
36. Apparatus according to claim 28, wherein the at least one processor is additionally configured to: process information transmitted from the programming entity in at least one first partition, in which the ACK / NACK payload is associated with the information on at least the first partition.
[37]
37. Apparatus according to claim 28, wherein the ACK / NACK payload is transmitted using frequency hopping based on a radio resource configuration from the programming entity.
[38]
38. Apparatus according to claim 37, wherein an allocation of a resource block for a second frequency hop is a function of at least one resource block allocation of a first frequency hop.
[39]
39. Apparatus according to claim 37, wherein a resource block allocation for a second frequency hop is a function of a resource block allocation of a first frequency hop and a partition index.
[40]
40. Non-transient computer-readable medium that stores executable code by computer, comprises code to make a computer: obtain an allocation of resources to transmit a confirmation payload (ACK) / negative confirmation (NACK), in which the allocation of resources is obtained by mapping to one of a plurality of sequences for a transmission based on the ACK / NACK payload sequence, where the mapping varies with time based on one or more parameters; and transmit the ACK / NACK payload based on the resource allocation obtained.
[41]
41. Device for wireless communication, which comprises: means to obtain an allocation of resources for transmission of a confirmation payload (ACK) / negative confirmation (NACK), in which the allocation of resources is obtained by mapping to one among one plurality of sequences for a transmission based on ACK / NACK payload sequence, in which the mapping varies with time based on one or more parameters; and means for transmitting the ACK / NACK payload based on the allocation of resources obtained.
[42]
42. Apparatus according to claim 41, further comprising: means for processing information transmitted from the programming entity on at least one first partition, wherein the ACK / NACK payload is associated with the information on at least first partition.

类似技术:

---

公开号 | 公开日 | 专利标题

---

BR112020004668A2|2020-09-15|uplink commit mapping and resource allocation

---

US11228992B2|2022-01-18|Uplink transmissions without timing synchronization in wireless communication

---

BR112019022028A2|2020-05-12|FLEXIBLE PROGRAMMING IN NOVA RADIO NETWORKS |

---

US10651995B2|2020-05-12|Transmission of group common control information in new radio

---

BR112020004707A2|2020-09-08|system and method for selecting resources to transmit beam failure recovery request

---

US10742234B2|2020-08-11|Code block group definition configuration for wireless communication

---

BR112019022292A2|2020-05-19|port group and port subset indication in a csi-rs resource for new radio |

---

EP3636021B1|2022-03-02|Transmission of uplink control information in new radio

---

US11121825B2|2021-09-14|Mapping uplink control information to uplink data channel in wireless communication

---

US10680751B2|2020-06-09|Methods and apparatus for determining transport block size in wireless communication

---

BR112020000198A2|2020-07-07|uplink hop pattern modes for hybrid auto-repeat request | transmissions

---

WO2019210193A1|2019-10-31|Mapping a physical downlink control channel | across multiple transmission configuration indication | states

---

US20200344736A1|2020-10-29|Dynamic padding field to match downlink and uplink downlink control information length

---

US11026218B2|2021-06-01|Indication on joint multi-transmission point transmission in new radio system

同族专利:

---

公开号 | 公开日

---

US20190081763A1|2019-03-14|

---

CN110999152A|2020-04-10|

---

US11139941B2|2021-10-05|

---

EP3682574A1|2020-07-22|

---

TW201921869A|2019-06-01|

---

EP3855653A1|2021-07-28|

---

CA3073528A1|2019-03-14|

---

WO2019051485A1|2019-03-14|

---

JP2020533890A|2020-11-19|

---

KR20200052278A|2020-05-14|

引用文献:

---

公开号 | 申请日 | 公开日 | 申请人 | 专利标题

---

---

US20140119284A1|2012-05-11|2014-05-01|Telefonaktiebolaget L M Ericsson |Resources for Multi-Cell Channel State Information Feedback|

---

US9270440B2|2012-11-02|2016-02-23|Qualcomm Incorporated|Processing overlapping EPDCCH resource sets|

---

US20190124647A1|2017-10-23|2019-04-25|Mediatek Inc.|Configuration and selection of pucch resource set|US10708938B2|2016-10-31|2020-07-07|Samsung Electronics Co., Ltd.|Transmission of UL control channels with dynamic structures|

---

EP3665842A1|2017-08-10|2020-06-17|SHARP Kabushiki Kaisha|Multiple slot long physical uplink control channeldesign for 5th generationnew radio |

---

WO2019088787A1|2017-11-03|2019-05-09|엘지전자 주식회사|Method for transmitting and receiving plurality of slot-based long pucchs in wireless communication system and apparatus therefor|

---

US10616888B2|2017-11-16|2020-04-07|Sharp Laboratories Of America, Inc.|Multiple slot long physical uplink control channeldesign for 5th generationnew radio |

---

US10779310B2|2017-11-16|2020-09-15|Qualcomm Incorporated|Uplink control channel resource allocation for new radio |

---

US10958383B2|2017-12-06|2021-03-23|Qualcomm Incorporated|Time based redundancy version determination for grant-free signaling|

---

US10547347B2|2018-01-12|2020-01-28|At&T Intellectual Property I, L.P.|Uplink coverage for 5G or other next generation network using multi-slot frequency hopping|

---

US10673646B1|2018-12-09|2020-06-02|Olibra Llc|System, device, and method of multi-path wireless communication|

---

CN110115088A|2019-03-28|2019-08-09|北京小米移动软件有限公司|Resource indicating method, device, system and storage medium in unlicensed spectrum|

---

WO2020227122A1|2019-05-03|2020-11-12|Apple Inc.|System and method for dmrs antenna port indication for urllc|

---

WO2021131233A1|2019-12-24|2021-07-01|ソニーグループ株式会社|Wireless terminal and transmission method therefor, and base station and reception method therefor|

法律状态:
2021-11-23| B350| Update of information on the portal [chapter 15.35 patent gazette]|

优先权:

---

申请号 | 申请日 | 专利标题

---

US201762557103P| true| 2017-09-11|2017-09-11|

---

US62/557,103|2017-09-11|

---

US16/126,993|US11139941B2|2017-09-11|2018-09-10|Uplink acknowledgment mapping and resource allocation|

---

US16/126,993|2018-09-10|

---

PCT/US2018/050466|WO2019051485A1|2017-09-11|2018-09-11|Uplink acknowledgment mapping and resource allocation|

---